/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/forester-heap/sll-reverse_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:23:30,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:23:30,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:23:30,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:23:30,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:23:30,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:23:30,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:23:30,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:23:30,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:23:30,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:23:30,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:23:30,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:23:30,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:23:30,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:23:30,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:23:30,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:23:30,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:23:30,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:23:30,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:23:30,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:23:30,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:23:30,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:23:30,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:23:30,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:23:30,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:23:30,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:23:30,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:23:30,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:23:30,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:23:30,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:23:30,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:23:30,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:23:30,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:23:30,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:23:30,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:23:30,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:23:30,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:23:30,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:23:30,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:23:30,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:23:30,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:23:30,404 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:23:30,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:23:30,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:23:30,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:23:30,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:23:30,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:23:30,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:23:30,429 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:23:30,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:23:30,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:23:30,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:23:30,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:23:30,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:23:30,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:23:30,430 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:23:30,430 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:23:30,430 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:23:30,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:23:30,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:23:30,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:23:30,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:23:30,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:23:30,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:23:30,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:23:30,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:23:30,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:23:30,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:23:30,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:23:30,432 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:23:30,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:23:30,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:23:30,432 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:23:30,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:23:30,433 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:23:30,433 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:23:30,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:23:30,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:23:30,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:23:30,660 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:23:30,661 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:23:30,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2022-01-11 05:23:30,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce55a0995/e0a91c5c76c7474a9cec67a32a1a8ba1/FLAGddd961cbb [2022-01-11 05:23:31,029 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:23:31,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2022-01-11 05:23:31,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce55a0995/e0a91c5c76c7474a9cec67a32a1a8ba1/FLAGddd961cbb [2022-01-11 05:23:31,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce55a0995/e0a91c5c76c7474a9cec67a32a1a8ba1 [2022-01-11 05:23:31,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:23:31,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:23:31,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:23:31,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:23:31,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:23:31,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44761628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31, skipping insertion in model container [2022-01-11 05:23:31,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:23:31,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:23:31,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22251,22264] [2022-01-11 05:23:31,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22336,22349] [2022-01-11 05:23:31,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22829,22842] [2022-01-11 05:23:31,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:23:31,712 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:23:31,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22251,22264] [2022-01-11 05:23:31,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22336,22349] [2022-01-11 05:23:31,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22829,22842] [2022-01-11 05:23:31,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:23:31,756 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:23:31,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31 WrapperNode [2022-01-11 05:23:31,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:23:31,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:23:31,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:23:31,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:23:31,762 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:23:31" (1/1) ... [2022-01-11 05:23:31,772 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:23:31" (1/1) ... [2022-01-11 05:23:31,787 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2022-01-11 05:23:31,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:23:31,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:23:31,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:23:31,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:23:31,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:23:31,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:23:31,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:23:31,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:23:31,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31" (1/1) ... [2022-01-11 05:23:31,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:23:31,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:31,845 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:23:31,853 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:23:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:23:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:23:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:23:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:23:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:23:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:23:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:23:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:23:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:23:31,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:23:31,997 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:23:31,998 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:23:32,300 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:23:32,304 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:23:32,304 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-01-11 05:23:32,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:23:32 BoogieIcfgContainer [2022-01-11 05:23:32,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:23:32,306 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:23:32,306 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:23:32,307 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:23:32,311 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:23:32" (1/1) ... [2022-01-11 05:23:32,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:23:32 BasicIcfg [2022-01-11 05:23:32,398 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:23:32,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:23:32,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:23:32,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:23:32,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:23:31" (1/4) ... [2022-01-11 05:23:32,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1202e13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:23:32, skipping insertion in model container [2022-01-11 05:23:32,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:31" (2/4) ... [2022-01-11 05:23:32,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1202e13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:23:32, skipping insertion in model container [2022-01-11 05:23:32,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:23:32" (3/4) ... [2022-01-11 05:23:32,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1202e13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:23:32, skipping insertion in model container [2022-01-11 05:23:32,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:23:32" (4/4) ... [2022-01-11 05:23:32,406 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.iTransformedIcfg [2022-01-11 05:23:32,410 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:23:32,410 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 05:23:32,441 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:23:32,447 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:23:32,447 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 05:23:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 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:23:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-11 05:23:32,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:32,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:32,464 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:23:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:32,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1770789928, now seen corresponding path program 1 times [2022-01-11 05:23:32,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:32,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902580712] [2022-01-11 05:23:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:32,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:32,638 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:23:32,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:32,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902580712] [2022-01-11 05:23:32,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902580712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:23:32,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:23:32,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:23:32,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986641878] [2022-01-11 05:23:32,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:23:32,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:23:32,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:32,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:23:32,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:23:32,678 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:23:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:32,693 INFO L93 Difference]: Finished difference Result 67 states and 107 transitions. [2022-01-11 05:23:32,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:23:32,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-01-11 05:23:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:32,701 INFO L225 Difference]: With dead ends: 67 [2022-01-11 05:23:32,701 INFO L226 Difference]: Without dead ends: 29 [2022-01-11 05:23:32,704 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:23:32,708 INFO L933 BasicCegarLoop]: 42 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, 42 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:23:32,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:23:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-11 05:23:32,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-11 05:23:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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:23:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-01-11 05:23:32,741 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2022-01-11 05:23:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:32,742 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-01-11 05:23:32,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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:23:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-01-11 05:23:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-11 05:23:32,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:32,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:32,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:23:32,744 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:23:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash 968747949, now seen corresponding path program 1 times [2022-01-11 05:23:32,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:32,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877485285] [2022-01-11 05:23:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:32,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:32,853 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:23:32,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:32,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877485285] [2022-01-11 05:23:32,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877485285] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:23:32,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:23:32,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 05:23:32,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244835237] [2022-01-11 05:23:32,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:23:32,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:23:32,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:32,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:23:32,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:23:32,860 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:23:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:32,976 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-01-11 05:23:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:23:32,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-01-11 05:23:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:32,977 INFO L225 Difference]: With dead ends: 54 [2022-01-11 05:23:32,977 INFO L226 Difference]: Without dead ends: 40 [2022-01-11 05:23:32,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:23:32,978 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:32,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:23:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-11 05:23:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-01-11 05:23:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-01-11 05:23:32,983 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 8 [2022-01-11 05:23:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:32,983 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-01-11 05:23:32,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:23:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-01-11 05:23:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-11 05:23:32,984 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:32,984 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:32,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:23:32,984 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:23:32,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:32,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1246276163, now seen corresponding path program 1 times [2022-01-11 05:23:32,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:32,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637994347] [2022-01-11 05:23:32,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:32,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:33,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:33,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637994347] [2022-01-11 05:23:33,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637994347] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:33,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952314508] [2022-01-11 05:23:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:33,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:33,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:33,125 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:23:33,135 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:23:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:33,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-11 05:23:33,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:33,341 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 25 treesize of output 17 [2022-01-11 05:23:33,352 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 21 treesize of output 13 [2022-01-11 05:23:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:33,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:33,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952314508] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:33,528 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:33,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-11 05:23:33,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047913930] [2022-01-11 05:23:33,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:33,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 05:23:33,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:33,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 05:23:33,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:23:33,531 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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:23:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:33,748 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-01-11 05:23:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:23:33,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 13 [2022-01-11 05:23:33,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:33,749 INFO L225 Difference]: With dead ends: 35 [2022-01-11 05:23:33,749 INFO L226 Difference]: Without dead ends: 31 [2022-01-11 05:23:33,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:23:33,750 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:33,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:23:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-11 05:23:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-01-11 05:23:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 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:23:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-01-11 05:23:33,757 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2022-01-11 05:23:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:33,757 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-01-11 05:23:33,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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:23:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-01-11 05:23:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:23:33,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:33,757 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:23:33,777 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:23:33,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:33,975 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:23:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:33,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2003863423, now seen corresponding path program 1 times [2022-01-11 05:23:33,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:33,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799179349] [2022-01-11 05:23:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:33,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:34,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:34,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799179349] [2022-01-11 05:23:34,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799179349] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:34,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234393835] [2022-01-11 05:23:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:34,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:34,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:34,176 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:23:34,177 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:23:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:34,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-11 05:23:34,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:34,295 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:23:34,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 14 [2022-01-11 05:23:34,421 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:23:34,421 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 37 treesize of output 36 [2022-01-11 05:23:34,431 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-11 05:23:34,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 18 [2022-01-11 05:23:34,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:34,536 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:34,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 15 [2022-01-11 05:23:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:34,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:34,650 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:34,651 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 39 treesize of output 31 [2022-01-11 05:23:34,659 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:34,660 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 92 treesize of output 67 [2022-01-11 05:23:34,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-01-11 05:23:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:35,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234393835] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:35,232 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:35,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-01-11 05:23:35,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111485757] [2022-01-11 05:23:35,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:35,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-11 05:23:35,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:35,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-11 05:23:35,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-01-11 05:23:35,233 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:35,426 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-01-11 05:23:35,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-11 05:23:35,427 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 05:23:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:35,428 INFO L225 Difference]: With dead ends: 68 [2022-01-11 05:23:35,428 INFO L226 Difference]: Without dead ends: 58 [2022-01-11 05:23:35,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-01-11 05:23:35,429 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 90 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:35,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 139 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 114 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-01-11 05:23:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-11 05:23:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2022-01-11 05:23:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-11 05:23:35,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 18 [2022-01-11 05:23:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:35,433 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-11 05:23:35,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-11 05:23:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:23:35,434 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:35,434 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:23:35,451 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:23:35,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-11 05:23:35,646 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:23:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash 483649410, now seen corresponding path program 1 times [2022-01-11 05:23:35,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:35,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337174076] [2022-01-11 05:23:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:35,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:35,777 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:23:35,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:35,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337174076] [2022-01-11 05:23:35,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337174076] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:23:35,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:23:35,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:23:35,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979931897] [2022-01-11 05:23:35,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:23:35,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:23:35,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:35,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:23:35,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:23:35,779 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:35,853 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-01-11 05:23:35,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:23:35,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-11 05:23:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:35,853 INFO L225 Difference]: With dead ends: 66 [2022-01-11 05:23:35,854 INFO L226 Difference]: Without dead ends: 53 [2022-01-11 05:23:35,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:23:35,854 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:35,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 56 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:23:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-11 05:23:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2022-01-11 05:23:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 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:23:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-01-11 05:23:35,859 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 18 [2022-01-11 05:23:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:35,859 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-01-11 05:23:35,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-01-11 05:23:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 05:23:35,859 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:35,859 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:35,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 05:23:35,860 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:23:35,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1162814432, now seen corresponding path program 2 times [2022-01-11 05:23:35,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:35,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487540543] [2022-01-11 05:23:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:35,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:36,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:36,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:36,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487540543] [2022-01-11 05:23:36,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487540543] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:36,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486222402] [2022-01-11 05:23:36,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:23:36,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:36,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:36,400 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:23:36,401 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:23:36,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:23:36,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:23:36,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-11 05:23:36,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:36,711 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:23:36,813 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:23:36,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,860 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 26 treesize of output 28 [2022-01-11 05:23:36,880 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-11 05:23:36,891 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:23:36,891 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 39 treesize of output 38 [2022-01-11 05:23:36,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,897 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 22 treesize of output 24 [2022-01-11 05:23:36,906 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-11 05:23:36,906 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 24 treesize of output 18 [2022-01-11 05:23:36,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,998 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:23:37,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:37,002 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-11 05:23:37,050 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:23:37,055 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 22 treesize of output 24 [2022-01-11 05:23:37,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:23:37,175 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 43 treesize of output 31 [2022-01-11 05:23:37,179 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 37 treesize of output 21 [2022-01-11 05:23:37,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:37,184 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:37,184 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 23 treesize of output 10 [2022-01-11 05:23:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:37,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:37,498 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:37,499 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 119 treesize of output 112 [2022-01-11 05:23:37,510 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:37,511 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 218 treesize of output 217 [2022-01-11 05:23:37,515 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 217 treesize of output 213 [2022-01-11 05:23:38,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:38,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-01-11 05:23:38,719 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:38,719 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 28 treesize of output 32 [2022-01-11 05:23:38,997 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:38,998 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 28 treesize of output 32 [2022-01-11 05:23:39,271 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:39,272 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 28 treesize of output 32 [2022-01-11 05:23:39,639 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:39,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 32 [2022-01-11 05:23:39,842 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:39,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 32 [2022-01-11 05:23:40,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:40,285 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:40,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 253 treesize of output 174 [2022-01-11 05:23:40,299 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:40,299 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 266 treesize of output 266 [2022-01-11 05:23:40,314 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:40,315 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 358 treesize of output 358 [2022-01-11 05:23:40,326 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 309 treesize of output 285 [2022-01-11 05:23:40,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:40,334 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 279 treesize of output 267 [2022-01-11 05:23:40,341 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 267 treesize of output 243 [2022-01-11 05:23:40,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:40,349 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 237 treesize of output 225 [2022-01-11 05:23:40,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-11 05:23:40,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-11 05:23:40,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-11 05:23:40,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-01-11 05:23:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:41,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486222402] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:41,693 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:41,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-01-11 05:23:41,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379453550] [2022-01-11 05:23:41,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:41,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-11 05:23:41,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:41,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-11 05:23:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=624, Unknown=2, NotChecked=0, Total=702 [2022-01-11 05:23:41,694 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 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:23:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:42,355 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-01-11 05:23:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-11 05:23:42,355 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 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 19 [2022-01-11 05:23:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:42,356 INFO L225 Difference]: With dead ends: 79 [2022-01-11 05:23:42,356 INFO L226 Difference]: Without dead ends: 77 [2022-01-11 05:23:42,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=1177, Unknown=2, NotChecked=0, Total=1332 [2022-01-11 05:23:42,357 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 89 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:42,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 274 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 169 Invalid, 0 Unknown, 167 Unchecked, 0.2s Time] [2022-01-11 05:23:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-11 05:23:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2022-01-11 05:23:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 0 states have call successors, (0), 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:23:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-01-11 05:23:42,362 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 19 [2022-01-11 05:23:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:42,362 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-01-11 05:23:42,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 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:23:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-01-11 05:23:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 05:23:42,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:42,363 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:42,380 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:23:42,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:42,580 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:23:42,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:42,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1162813471, now seen corresponding path program 1 times [2022-01-11 05:23:42,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:42,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007746471] [2022-01-11 05:23:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:42,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:23:42,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:42,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007746471] [2022-01-11 05:23:42,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007746471] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:23:42,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:23:42,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:23:42,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363229930] [2022-01-11 05:23:42,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:23:42,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:23:42,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:23:42,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:23:42,617 INFO L87 Difference]: Start difference. First operand 48 states and 60 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:23:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:42,628 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-01-11 05:23:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:23:42,629 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 19 [2022-01-11 05:23:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:42,629 INFO L225 Difference]: With dead ends: 56 [2022-01-11 05:23:42,629 INFO L226 Difference]: Without dead ends: 54 [2022-01-11 05:23:42,630 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:23:42,630 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:42,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:23:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-11 05:23:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-01-11 05:23:42,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 0 states have call successors, (0), 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:23:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-01-11 05:23:42,639 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 19 [2022-01-11 05:23:42,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:42,639 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-01-11 05:23:42,639 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:23:42,639 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-01-11 05:23:42,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 05:23:42,639 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:42,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:42,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 05:23:42,640 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:23:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:42,640 INFO L85 PathProgramCache]: Analyzing trace with hash 948344916, now seen corresponding path program 1 times [2022-01-11 05:23:42,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:42,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037921952] [2022-01-11 05:23:42,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:42,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:42,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:42,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037921952] [2022-01-11 05:23:42,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037921952] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:42,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554564970] [2022-01-11 05:23:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:42,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:42,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:42,973 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:23:42,974 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:23:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:43,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-11 05:23:43,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:43,166 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-11 05:23:43,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 68 [2022-01-11 05:23:43,188 INFO L353 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2022-01-11 05:23:43,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 86 [2022-01-11 05:23:43,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:43,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 [2022-01-11 05:23:43,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-01-11 05:23:43,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:43,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-11 05:23:43,346 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 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-11 05:23:43,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:43,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:43,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2022-01-11 05:23:43,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-11 05:23:43,414 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 5 treesize of output 3 [2022-01-11 05:23:43,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:43,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-01-11 05:23:43,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:43,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:43,685 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:23:43,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 36 [2022-01-11 05:23:43,708 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 6 treesize of output 5 [2022-01-11 05:23:43,773 INFO L353 Elim1Store]: treesize reduction 37, result has 21.3 percent of original size [2022-01-11 05:23:43,773 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 59 [2022-01-11 05:23:43,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:43,779 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 28 treesize of output 30 [2022-01-11 05:23:43,791 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 11 [2022-01-11 05:23:43,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:43,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:43,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-01-11 05:23:43,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:43,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-01-11 05:23:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:44,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:44,188 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 201 treesize of output 193 [2022-01-11 05:23:44,213 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:44,214 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 213 treesize of output 215 [2022-01-11 05:23:44,219 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 189 treesize of output 181 [2022-01-11 05:23:44,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_462 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27| Int) (v_ArrVal_458 Int)) (let ((.cse2 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_458))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| .cse2) .cse1 v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 .cse0)) (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|) (not (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|)) (not (<= .cse0 0))))))) is different from false [2022-01-11 05:23:45,514 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28| Int) (v_ArrVal_462 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27| Int) (v_ArrVal_458 Int)) (let ((.cse2 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28|) 18446744073709551616) v_ArrVal_458))) (let ((.cse1 (select .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| .cse2) .cse1 v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|)) (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28|)) (and (not (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|)) (= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28| |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|)) (not (<= .cse0 0))))))) is different from false [2022-01-11 05:23:46,052 INFO L353 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-01-11 05:23:46,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 508 treesize of output 410 [2022-01-11 05:23:46,090 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:46,091 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 710 treesize of output 702 [2022-01-11 05:23:46,119 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 557 treesize of output 541 [2022-01-11 05:23:46,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:46,142 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:46,142 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 3017 treesize of output 2983 [2022-01-11 05:23:49,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:49,567 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:49,568 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 69 treesize of output 69 [2022-01-11 05:23:49,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:49,715 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:49,715 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 101 treesize of output 101 [2022-01-11 05:23:55,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:55,155 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:55,156 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 673 treesize of output 669 [2022-01-11 05:23:56,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:56,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:56,230 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:56,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 940 treesize of output 911 [2022-01-11 05:23:57,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:57,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:57,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:57,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:57,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 774 treesize of output 748 [2022-01-11 05:23:57,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:57,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:57,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:57,882 INFO L353 Elim1Store]: treesize reduction 5, result has 16.7 percent of original size [2022-01-11 05:23:57,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 894 treesize of output 1 [2022-01-11 05:23:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-11 05:23:57,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554564970] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:57,989 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:57,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2022-01-11 05:23:57,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479815265] [2022-01-11 05:23:57,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:57,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-11 05:23:57,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-11 05:23:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=438, Unknown=2, NotChecked=86, Total=600 [2022-01-11 05:23:57,990 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:58,036 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|))) (let ((.cse1 (= |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| 0)) (.cse4 (= 0 .cse3)) (.cse2 (= |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|))) (and (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| 0)) (exists ((|ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| Int)) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|) (let ((.cse0 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|))) (or (= (select (select |c_#memory_$Pointer$.baseInt| (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) 0) (= (select .cse0 |ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|) 0))) (<= |ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| 0))) (or (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| 0)) (not .cse1)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0) .cse1 (or (and .cse2 (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| .cse3))) .cse4) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) 0))) (not (<= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| 0)) (or (<= (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|) 0) (not .cse4) (and (< 0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) .cse2)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28| Int) (v_ArrVal_462 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27| Int) (v_ArrVal_458 Int)) (let ((.cse7 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28|) 18446744073709551616) v_ArrVal_458))) (let ((.cse6 (select .cse7 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28|))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| .cse7) .cse6 v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|)) (not (<= 0 .cse5)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28|)) (and (not (= .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|)) (= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28| |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|)) (not (<= .cse5 0))))))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)))) is different from false [2022-01-11 05:23:58,069 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| 0)) (exists ((|ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| Int)) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|) (let ((.cse0 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|))) (or (= (select (select |c_#memory_$Pointer$.baseInt| (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) 0) (= (select .cse0 |ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|) 0))) (<= |ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| 0))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) 0))) (not (<= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28| Int) (v_ArrVal_462 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27| Int) (v_ArrVal_458 Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28|) 18446744073709551616) v_ArrVal_458))) (let ((.cse2 (select .cse3 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28|))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| .cse3) .cse2 v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|)) (not (<= 0 .cse1)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28|)) (and (not (= .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|)) (= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_28| |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_27|)) (not (<= .cse1 0))))))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) is different from false [2022-01-11 05:24:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:02,959 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2022-01-11 05:24:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-11 05:24:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-11 05:24:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:02,961 INFO L225 Difference]: With dead ends: 91 [2022-01-11 05:24:02,961 INFO L226 Difference]: Without dead ends: 80 [2022-01-11 05:24:02,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=232, Invalid=1112, Unknown=4, NotChecked=292, Total=1640 [2022-01-11 05:24:02,962 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 65 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:02,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 221 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 179 Invalid, 0 Unknown, 183 Unchecked, 0.2s Time] [2022-01-11 05:24:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-11 05:24:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 58. [2022-01-11 05:24:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 0 states have call successors, (0), 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:02,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2022-01-11 05:24:02,968 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 19 [2022-01-11 05:24:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:02,968 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2022-01-11 05:24:02,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2022-01-11 05:24:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 05:24:02,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:02,969 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:02,986 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:03,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:03,183 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash -860099487, now seen corresponding path program 3 times [2022-01-11 05:24:03,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:03,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632356073] [2022-01-11 05:24:03,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:03,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:03,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:03,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632356073] [2022-01-11 05:24:03,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632356073] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:03,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892981916] [2022-01-11 05:24:03,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-11 05:24:03,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:03,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:03,352 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:03,383 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:03,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-11 05:24:03,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:24:03,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-11 05:24:03,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:03,854 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:03,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:03,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:03,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2022-01-11 05:24:03,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:03,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:03,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2022-01-11 05:24:03,962 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 8 treesize of output 7 [2022-01-11 05:24:03,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:03,975 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-11 05:24:03,975 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 56 [2022-01-11 05:24:03,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:03,980 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 0 case distinctions, treesize of input 35 treesize of output 35 [2022-01-11 05:24:03,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:03,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 27 [2022-01-11 05:24:03,995 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:03,995 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:04,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-01-11 05:24:04,068 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-11 05:24:04,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 45 [2022-01-11 05:24:04,072 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 34 treesize of output 26 [2022-01-11 05:24:04,074 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 0 case distinctions, treesize of input 39 treesize of output 35 [2022-01-11 05:24:04,076 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 14 [2022-01-11 05:24:04,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 15 treesize of output 7 [2022-01-11 05:24:04,099 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:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:04,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:04,157 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_593 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| v_ArrVal_593) (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|)) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|)) 0)) (forall ((v_ArrVal_594 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| v_ArrVal_594) (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|)) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt|)) 0))) is different from false [2022-01-11 05:24:04,275 INFO L353 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-01-11 05:24:04,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 356 [2022-01-11 05:24:04,335 INFO L353 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-01-11 05:24:04,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 654 treesize of output 574 [2022-01-11 05:24:04,453 INFO L353 Elim1Store]: treesize reduction 50, result has 77.0 percent of original size [2022-01-11 05:24:04,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3828 treesize of output 3660 [2022-01-11 05:24:04,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:04,491 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:04,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 3660 treesize of output 3166 [2022-01-11 05:24:04,652 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:04,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 7549 treesize of output 7177 [2022-01-11 05:24:04,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:04,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:04,891 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:04,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10039 treesize of output 9947 [2022-01-11 05:24:05,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:05,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:24:05,655 INFO L353 Elim1Store]: treesize reduction 8, result has 97.0 percent of original size [2022-01-11 05:24:05,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 9806 treesize of output 9850 [2022-01-11 05:24:06,234 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:06,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 9104 treesize of output 8881 [2022-01-11 05:24:06,559 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:24:06,560 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 8744 treesize of output 8665