/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/ldv-regression/ex3_forlist.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:52:14,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:52:14,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:52:14,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:52:14,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:52:14,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:52:14,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:52:14,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:52:14,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:52:14,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:52:14,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:52:14,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:52:14,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:52:14,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:52:14,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:52:14,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:52:14,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:52:14,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:52:14,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:52:14,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:52:14,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:52:14,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:52:14,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:52:14,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:52:14,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:52:14,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:52:14,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:52:14,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:52:14,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:52:14,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:52:14,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:52:14,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:52:14,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:52:14,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:52:14,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:52:14,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:52:14,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:52:14,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:52:14,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:52:14,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:52:14,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:52:14,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:52:14,570 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:52:14,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:52:14,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:52:14,571 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:52:14,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:52:14,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:52:14,572 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:52:14,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:52:14,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:52:14,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:52:14,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:52:14,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:52:14,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:52:14,573 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:52:14,573 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:52:14,573 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:52:14,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:52:14,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:52:14,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:52:14,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:52:14,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:52:14,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:52:14,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:52:14,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:52:14,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:52:14,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:52:14,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:52:14,574 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:52:14,574 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:52:14,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:52:14,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:52:14,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:52:14,575 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:52:14,576 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 11:52:14,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:52:14,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:52:14,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:52:14,787 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:52:14,789 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:52:14,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2022-01-10 11:52:14,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff7dde33/f3e99dc9d66842e4afc1920348a30e5d/FLAG80abd9283 [2022-01-10 11:52:15,145 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:52:15,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i [2022-01-10 11:52:15,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff7dde33/f3e99dc9d66842e4afc1920348a30e5d/FLAG80abd9283 [2022-01-10 11:52:15,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff7dde33/f3e99dc9d66842e4afc1920348a30e5d [2022-01-10 11:52:15,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:52:15,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:52:15,599 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:52:15,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:52:15,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:52:15,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2f22f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15, skipping insertion in model container [2022-01-10 11:52:15,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:52:15,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:52:15,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i[293,306] [2022-01-10 11:52:15,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:52:15,800 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:52:15,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/ex3_forlist.i[293,306] [2022-01-10 11:52:15,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:52:15,845 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:52:15,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15 WrapperNode [2022-01-10 11:52:15,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:52:15,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:52:15,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:52:15,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:52:15,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,890 INFO L137 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 138 [2022-01-10 11:52:15,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:52:15,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:52:15,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:52:15,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:52:15,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:52:15,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:52:15,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:52:15,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:52:15,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (1/1) ... [2022-01-10 11:52:15,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:52:15,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:15,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 11:52:15,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 11:52:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:52:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 11:52:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:52:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:52:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-01-10 11:52:15,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:52:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 11:52:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:52:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:52:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 11:52:16,064 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:52:16,065 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:52:16,413 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:52:16,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:52:16,417 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 11:52:16,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:52:16 BoogieIcfgContainer [2022-01-10 11:52:16,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:52:16,418 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:52:16,419 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:52:16,424 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:52:16,426 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:52:16" (1/1) ... [2022-01-10 11:52:16,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:52:16 BasicIcfg [2022-01-10 11:52:16,533 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:52:16,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:52:16,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:52:16,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:52:16,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:52:15" (1/4) ... [2022-01-10 11:52:16,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6232e1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:52:16, skipping insertion in model container [2022-01-10 11:52:16,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:52:15" (2/4) ... [2022-01-10 11:52:16,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6232e1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:52:16, skipping insertion in model container [2022-01-10 11:52:16,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:52:16" (3/4) ... [2022-01-10 11:52:16,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6232e1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:52:16, skipping insertion in model container [2022-01-10 11:52:16,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:52:16" (4/4) ... [2022-01-10 11:52:16,547 INFO L111 eAbstractionObserver]: Analyzing ICFG ex3_forlist.iTransformedIcfg [2022-01-10 11:52:16,550 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:52:16,550 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 11:52:16,581 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:52:16,585 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 11:52:16,586 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 11:52:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 11:52:16,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:16,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:16,599 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:16,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2019735446, now seen corresponding path program 1 times [2022-01-10 11:52:16,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:16,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028246677] [2022-01-10 11:52:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:16,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:16,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:16,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028246677] [2022-01-10 11:52:16,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028246677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:52:16,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:52:16,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:52:16,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290050209] [2022-01-10 11:52:16,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:52:16,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:52:16,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:16,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:52:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:52:16,761 INFO L87 Difference]: Start difference. First operand has 37 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:16,776 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-01-10 11:52:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:52:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2022-01-10 11:52:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:16,782 INFO L225 Difference]: With dead ends: 68 [2022-01-10 11:52:16,782 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 11:52:16,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:52:16,788 INFO L933 BasicCegarLoop]: 44 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, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:16,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:52:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 11:52:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 11:52:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-01-10 11:52:16,811 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 15 [2022-01-10 11:52:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:16,812 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-01-10 11:52:16,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-01-10 11:52:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 11:52:16,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:16,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:16,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:52:16,816 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash -797195371, now seen corresponding path program 1 times [2022-01-10 11:52:16,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:16,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503170662] [2022-01-10 11:52:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:16,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:16,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:16,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503170662] [2022-01-10 11:52:16,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503170662] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:52:16,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:52:16,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:52:16,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614649226] [2022-01-10 11:52:16,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:52:16,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:52:16,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:16,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:52:16,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:52:16,992 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:17,023 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-01-10 11:52:17,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:52:17,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-01-10 11:52:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:17,028 INFO L225 Difference]: With dead ends: 60 [2022-01-10 11:52:17,028 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 11:52:17,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:52:17,030 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:17,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:52:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 11:52:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-10 11:52:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-01-10 11:52:17,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2022-01-10 11:52:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:17,041 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-01-10 11:52:17,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-01-10 11:52:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 11:52:17,043 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:17,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:17,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:52:17,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1242961229, now seen corresponding path program 1 times [2022-01-10 11:52:17,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:17,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540527229] [2022-01-10 11:52:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:17,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:52:17,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:17,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540527229] [2022-01-10 11:52:17,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540527229] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:52:17,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:52:17,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:52:17,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885186706] [2022-01-10 11:52:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:52:17,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:52:17,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:52:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:52:17,222 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:17,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:17,259 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2022-01-10 11:52:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:52:17,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-01-10 11:52:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:17,261 INFO L225 Difference]: With dead ends: 75 [2022-01-10 11:52:17,261 INFO L226 Difference]: Without dead ends: 55 [2022-01-10 11:52:17,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:52:17,262 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:17,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 62 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:52:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-10 11:52:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2022-01-10 11:52:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 11:52:17,267 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 17 [2022-01-10 11:52:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:17,268 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 11:52:17,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 11:52:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 11:52:17,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:17,268 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-10 11:52:17,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:52:17,269 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1527673332, now seen corresponding path program 1 times [2022-01-10 11:52:17,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:17,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741546043] [2022-01-10 11:52:17,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:17,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:17,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:17,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741546043] [2022-01-10 11:52:17,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741546043] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:52:17,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369324942] [2022-01-10 11:52:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:17,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:17,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:17,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:52:17,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 11:52:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:17,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 11:52:17,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:52:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:18,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:52:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:18,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369324942] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:52:18,076 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:52:18,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 11:52:18,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92596727] [2022-01-10 11:52:18,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:52:18,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:52:18,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:18,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:52:18,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:52:18,078 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:18,121 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-01-10 11:52:18,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:52:18,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 11:52:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:18,122 INFO L225 Difference]: With dead ends: 66 [2022-01-10 11:52:18,123 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 11:52:18,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:52:18,124 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:18,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:52:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 11:52:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-01-10 11:52:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-01-10 11:52:18,128 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 19 [2022-01-10 11:52:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:18,128 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-01-10 11:52:18,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-01-10 11:52:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 11:52:18,128 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:18,129 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:18,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 11:52:18,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:18,336 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:18,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash 12048914, now seen corresponding path program 2 times [2022-01-10 11:52:18,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:18,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699786251] [2022-01-10 11:52:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:18,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:22,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:22,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699786251] [2022-01-10 11:52:22,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699786251] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:52:22,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710382753] [2022-01-10 11:52:22,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:52:22,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:22,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:22,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:52:22,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 11:52:22,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 11:52:22,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:52:22,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-10 11:52:22,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:52:23,198 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 98 treesize of output 43 [2022-01-10 11:52:23,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:52:23,205 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 37 treesize of output 39 [2022-01-10 11:52:23,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:52:23,405 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 40 treesize of output 7 [2022-01-10 11:52:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 11:52:23,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 11:52:23,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710382753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:52:23,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:52:23,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 24 [2022-01-10 11:52:23,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842204822] [2022-01-10 11:52:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:52:23,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 11:52:23,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 11:52:23,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-01-10 11:52:23,465 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:23,822 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-01-10 11:52:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 11:52:23,822 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 11:52:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:23,823 INFO L225 Difference]: With dead ends: 57 [2022-01-10 11:52:23,823 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 11:52:23,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2022-01-10 11:52:23,824 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:23,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 168 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-01-10 11:52:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 11:52:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-01-10 11:52:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-01-10 11:52:23,829 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 21 [2022-01-10 11:52:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:23,829 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-01-10 11:52:23,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-01-10 11:52:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 11:52:23,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:23,830 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:23,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 11:52:24,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:24,037 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:24,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1230273882, now seen corresponding path program 1 times [2022-01-10 11:52:24,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:24,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441995109] [2022-01-10 11:52:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:24,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 11:52:24,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:24,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441995109] [2022-01-10 11:52:24,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441995109] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:52:24,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831833284] [2022-01-10 11:52:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:24,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:24,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:24,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:52:24,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 11:52:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:24,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 11:52:24,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:52:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:24,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:52:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 11:52:24,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831833284] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:52:24,428 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:52:24,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 8 [2022-01-10 11:52:24,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673620924] [2022-01-10 11:52:24,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:52:24,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 11:52:24,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:24,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 11:52:24,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 11:52:24,430 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:24,561 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2022-01-10 11:52:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 11:52:24,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 11:52:24,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:24,565 INFO L225 Difference]: With dead ends: 121 [2022-01-10 11:52:24,565 INFO L226 Difference]: Without dead ends: 100 [2022-01-10 11:52:24,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 11:52:24,566 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 145 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:24,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 228 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:52:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-01-10 11:52:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 45. [2022-01-10 11:52:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-01-10 11:52:24,571 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 23 [2022-01-10 11:52:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:24,571 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-01-10 11:52:24,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-01-10 11:52:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 11:52:24,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:24,572 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:24,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 11:52:24,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:24,784 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash 395204752, now seen corresponding path program 1 times [2022-01-10 11:52:24,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:24,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541492004] [2022-01-10 11:52:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:24,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 11:52:25,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:25,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541492004] [2022-01-10 11:52:25,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541492004] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:52:25,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386867898] [2022-01-10 11:52:25,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:25,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:25,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:25,988 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:52:25,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 11:52:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:26,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-10 11:52:26,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:52:26,860 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 27 treesize of output 23 [2022-01-10 11:52:27,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:52:27,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:52:27,127 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 42 treesize of output 39 [2022-01-10 11:52:27,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:52:27,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 38 [2022-01-10 11:52:27,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:52:27,278 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 27 treesize of output 7 [2022-01-10 11:52:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:27,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:52:27,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 Int) (v_ArrVal_471 (Array Int Int))) (= (select (store (select (store |c_#memory_intInt| |c_~#pp~0.baseInt| v_ArrVal_471) |c_~#pstate~0.baseInt|) (mod (+ (mod (+ (* (mod (div |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 2147483648) 2) 18446744056529682432) (* |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 4)) 18446744073709551616) |c_~#pstate~0.offsetInt|) 18446744073709551616) v_ArrVal_470) (+ |c_~#pstate~0.offsetInt| (* (div |c_~#pstate~0.offsetInt| 18446744073709551616) (- 18446744073709551616)))) 1)) is different from false [2022-01-10 11:52:27,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 Int) (v_ArrVal_471 (Array Int Int))) (= (select (store (select (store |c_#memory_intInt| |c_~#pp~0.baseInt| v_ArrVal_471) |c_~#pstate~0.baseInt|) (mod (+ |c_~#pstate~0.offsetInt| (mod (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 1) 4294967296))) (+ (* .cse0 4) (* 18446744056529682432 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616) v_ArrVal_470) (+ |c_~#pstate~0.offsetInt| (* (div |c_~#pstate~0.offsetInt| 18446744073709551616) (- 18446744073709551616)))) 1)) is different from false [2022-01-10 11:52:27,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 Int) (v_ArrVal_471 (Array Int Int))) (= (select (store (select (store |c_#memory_intInt| |c_~#pp~0.baseInt| v_ArrVal_471) |c_~#pstate~0.baseInt|) (mod (+ |c_~#pstate~0.offsetInt| 4) 18446744073709551616) v_ArrVal_470) (+ |c_~#pstate~0.offsetInt| (* (div |c_~#pstate~0.offsetInt| 18446744073709551616) (- 18446744073709551616)))) 1)) is different from false [2022-01-10 11:52:27,507 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:52:27,507 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 47 treesize of output 48 [2022-01-10 11:52:27,509 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 72 treesize of output 68 [2022-01-10 11:52:27,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:52:27,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 11:52:27,524 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:52:27,525 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 72 treesize of output 76 [2022-01-10 11:52:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 11:52:27,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386867898] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:52:27,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:52:27,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2022-01-10 11:52:27,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111457219] [2022-01-10 11:52:27,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:52:27,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-10 11:52:27,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:27,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-10 11:52:27,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=611, Unknown=3, NotChecked=162, Total=930 [2022-01-10 11:52:27,777 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:29,745 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-01-10 11:52:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 11:52:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 11:52:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:29,747 INFO L225 Difference]: With dead ends: 62 [2022-01-10 11:52:29,747 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 11:52:29,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=423, Invalid=1566, Unknown=3, NotChecked=264, Total=2256 [2022-01-10 11:52:29,749 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:29,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 289 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 189 Invalid, 0 Unknown, 156 Unchecked, 0.6s Time] [2022-01-10 11:52:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 11:52:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2022-01-10 11:52:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-01-10 11:52:29,757 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 24 [2022-01-10 11:52:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:29,757 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-01-10 11:52:29,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-01-10 11:52:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 11:52:29,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:29,757 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:29,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 11:52:29,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:29,963 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1805035091, now seen corresponding path program 1 times [2022-01-10 11:52:29,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:29,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593527009] [2022-01-10 11:52:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:29,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 11:52:30,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:30,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593527009] [2022-01-10 11:52:30,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593527009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:52:30,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:52:30,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:52:30,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626813828] [2022-01-10 11:52:30,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:52:30,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:52:30,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:30,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:52:30,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:52:30,028 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:30,054 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-01-10 11:52:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:52:30,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 11:52:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:30,055 INFO L225 Difference]: With dead ends: 72 [2022-01-10 11:52:30,055 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 11:52:30,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:52:30,056 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:30,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 59 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:52:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 11:52:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2022-01-10 11:52:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-01-10 11:52:30,064 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 26 [2022-01-10 11:52:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:30,065 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-01-10 11:52:30,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-01-10 11:52:30,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 11:52:30,066 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:30,066 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:30,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 11:52:30,067 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:30,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash 75846744, now seen corresponding path program 2 times [2022-01-10 11:52:30,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:30,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775531912] [2022-01-10 11:52:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:30,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 11:52:31,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:31,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775531912] [2022-01-10 11:52:31,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775531912] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:52:31,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541174718] [2022-01-10 11:52:31,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:52:31,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:31,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:31,434 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:52:31,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 11:52:31,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 11:52:31,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:52:31,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 11:52:31,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:52:31,678 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 27 treesize of output 23 [2022-01-10 11:52:31,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:52:31,870 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:52:31,871 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 27 treesize of output 10 [2022-01-10 11:52:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 11:52:31,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 11:52:31,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541174718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:52:31,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:52:31,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-01-10 11:52:31,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828970079] [2022-01-10 11:52:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:52:31,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 11:52:31,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:31,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 11:52:31,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-01-10 11:52:31,892 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:32,019 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-01-10 11:52:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 11:52:32,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 11:52:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:32,021 INFO L225 Difference]: With dead ends: 104 [2022-01-10 11:52:32,021 INFO L226 Difference]: Without dead ends: 102 [2022-01-10 11:52:32,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-01-10 11:52:32,022 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 83 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:32,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 175 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 53 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-01-10 11:52:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-10 11:52:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-01-10 11:52:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.309090909090909) internal successors, (72), 56 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-01-10 11:52:32,029 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 26 [2022-01-10 11:52:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:32,029 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-01-10 11:52:32,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-01-10 11:52:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 11:52:32,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:32,029 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:32,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-10 11:52:32,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:32,234 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:32,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:32,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1068673381, now seen corresponding path program 1 times [2022-01-10 11:52:32,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:32,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432142673] [2022-01-10 11:52:32,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:32,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:33,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:33,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432142673] [2022-01-10 11:52:33,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432142673] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:52:33,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971809456] [2022-01-10 11:52:33,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:33,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:33,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:33,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:52:33,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 11:52:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:34,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 11:52:34,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:52:34,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 11:52:34,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 11:52:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:52:34,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:52:34,785 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 30 treesize of output 28 [2022-01-10 11:52:34,786 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 58 treesize of output 52 [2022-01-10 11:52:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 11:52:35,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971809456] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:52:35,172 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:52:35,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 8] total 34 [2022-01-10 11:52:35,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331926232] [2022-01-10 11:52:35,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:52:35,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-10 11:52:35,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:35,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-10 11:52:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 11:52:35,174 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:48,989 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 11:52:51,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 11:52:51,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:51,799 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2022-01-10 11:52:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-10 11:52:51,799 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 11:52:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:51,800 INFO L225 Difference]: With dead ends: 159 [2022-01-10 11:52:51,800 INFO L226 Difference]: Without dead ends: 124 [2022-01-10 11:52:51,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=566, Invalid=3593, Unknown=1, NotChecked=0, Total=4160 [2022-01-10 11:52:51,801 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 320 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 161 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:51,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 515 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1005 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2022-01-10 11:52:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-10 11:52:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 69. [2022-01-10 11:52:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 68 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2022-01-10 11:52:51,815 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 27 [2022-01-10 11:52:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:51,815 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2022-01-10 11:52:51,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-01-10 11:52:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 11:52:51,818 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:51,818 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:51,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 11:52:52,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:52,024 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:52,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1032298158, now seen corresponding path program 2 times [2022-01-10 11:52:52,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:52,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43772169] [2022-01-10 11:52:52,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:52,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 11:52:52,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:52,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43772169] [2022-01-10 11:52:52,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43772169] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:52:52,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113394049] [2022-01-10 11:52:52,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:52:52,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:52,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:52,134 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:52:52,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 11:52:52,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 11:52:52,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:52:52,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 11:52:52,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:52:52,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-01-10 11:52:52,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:52:52,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:52:52,705 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 54 treesize of output 51 [2022-01-10 11:52:52,725 INFO L353 Elim1Store]: treesize reduction 97, result has 19.2 percent of original size [2022-01-10 11:52:52,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2022-01-10 11:52:52,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:52:52,813 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 27 treesize of output 7 [2022-01-10 11:52:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 11:52:52,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 11:52:52,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113394049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:52:52,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:52:52,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2022-01-10 11:52:52,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189726215] [2022-01-10 11:52:52,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:52:52,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 11:52:52,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:52,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 11:52:52,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-01-10 11:52:52,825 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:52,896 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-01-10 11:52:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 11:52:52,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 11:52:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:52,897 INFO L225 Difference]: With dead ends: 75 [2022-01-10 11:52:52,897 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 11:52:52,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-10 11:52:52,897 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:52,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2022-01-10 11:52:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 11:52:52,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-01-10 11:52:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 66 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2022-01-10 11:52:52,907 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 27 [2022-01-10 11:52:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:52,907 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2022-01-10 11:52:52,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:52:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-01-10 11:52:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 11:52:52,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:52,907 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:52,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-10 11:52:53,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:53,110 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:53,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash -960909416, now seen corresponding path program 1 times [2022-01-10 11:52:53,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:53,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324488138] [2022-01-10 11:52:53,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:53,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:52:59,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:59,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324488138] [2022-01-10 11:52:59,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324488138] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:52:59,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640318168] [2022-01-10 11:52:59,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:59,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:59,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:59,322 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:52:59,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 11:53:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:53:00,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 88 conjunts are in the unsatisfiable core [2022-01-10 11:53:00,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:53:00,295 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 30 treesize of output 30 [2022-01-10 11:53:00,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:00,299 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 30 treesize of output 32 [2022-01-10 11:53:00,304 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 30 treesize of output 30 [2022-01-10 11:53:00,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:00,308 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 30 treesize of output 32 [2022-01-10 11:53:00,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:00,471 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 28 treesize of output 30 [2022-01-10 11:53:00,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:00,476 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 27 treesize of output 27 [2022-01-10 11:53:00,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:00,499 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 28 treesize of output 30 [2022-01-10 11:53:00,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:00,504 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 27 treesize of output 27 [2022-01-10 11:53:01,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:01,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:01,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:53:01,046 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 51 treesize of output 47 [2022-01-10 11:53:01,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:01,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:01,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:53:01,057 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 51 treesize of output 47 [2022-01-10 11:53:01,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:01,063 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 41 treesize of output 41 [2022-01-10 11:53:01,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:01,068 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 64 treesize of output 62 [2022-01-10 11:53:01,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:01,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:53:01,315 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 13 [2022-01-10 11:53:01,863 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 19 treesize of output 3 [2022-01-10 11:53:01,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:01,991 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 64 treesize of output 62 [2022-01-10 11:53:02,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:53:02,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 69 treesize of output 13 [2022-01-10 11:53:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 11:53:02,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:53:02,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ |c_~#pp~0.offsetInt| (mod (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_g_~i~2#1Int| 1) 4294967296))) (+ (* .cse0 8) (* 18446744039349813248 (mod (div .cse0 2147483648) 2)))) 18446744073709551616)) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_g_~pointer#1.offsetInt|))) is different from false [2022-01-10 11:53:02,793 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 24 treesize of output 4 [2022-01-10 11:53:02,807 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) is different from false [2022-01-10 11:53:03,127 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1025 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 2147483648) 2) 18446744039349813248) (* |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_f_~pointer#1.baseInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1025) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0)) (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 2147483648) 2) 18446744039349813248) (* |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_f_~pointer#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1021) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0))) (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 2147483648) 2) 18446744039349813248) (* |c_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_f_~pointer#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 11:53:08,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| Int)) (or (and (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1021) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0)) (forall ((v_ArrVal_1025 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1025) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19|)) (not (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 0)))) is different from false [2022-01-10 11:53:11,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5| Int) (|v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_malloc_#res#1.offsetInt| (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_malloc_#res#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616)))) (and (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_malloc_#res#1.offsetInt|)) |c_~#pstate~0.baseInt| v_ArrVal_1021) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0)) (forall ((v_ArrVal_1025 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|)) |c_~#pstate~0.baseInt| v_ArrVal_1025) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5| |c_ULTIMATE.start_ULTIMATE.start_malloc_#res#1.baseInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|)))) is different from false [2022-01-10 11:53:14,679 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5| Int) (|v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| Int)) (or (< 0 |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19|)) (not (let ((.cse0 (+ (* 18446744069414584320 (mod (div c_~counter~0Int 2147483648) 2)) c_~counter~0Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) .cse0)) |c_~#pstate~0.baseInt| v_ArrVal_1028) |c_~#pp~0.baseInt|) (mod (+ 8 |c_~#pp~0.offsetInt|) 18446744073709551616))))) (and (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) (+ (* 18446744069414584320 (mod (div c_~counter~0Int 2147483648) 2)) c_~counter~0Int))) |c_~#pstate~0.baseInt| v_ArrVal_1021) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0)) (forall ((v_ArrVal_1025 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_~#pp~0.baseInt|) (mod (+ (mod (+ (* (mod (div |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 2147483648) 2) 18446744039349813248) (* |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 8)) 18446744073709551616) |c_~#pp~0.offsetInt|) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|)) |c_~#pstate~0.baseInt| v_ArrVal_1025) |c_~#pp~0.baseInt|) (mod |c_~#pp~0.offsetInt| 18446744073709551616)) 0))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_f_~i~1#1Int_19| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt_5|)))) is different from false