/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:30:38,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:30:38,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:30:38,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:30:38,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:30:38,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:30:38,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:30:38,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:30:38,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:30:38,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:30:38,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:30:38,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:30:38,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:30:38,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:30:38,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:30:38,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:30:38,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:30:38,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:30:38,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:30:38,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:30:38,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:30:38,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:30:38,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:30:38,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:30:38,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:30:38,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:30:38,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:30:38,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:30:38,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:30:38,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:30:38,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:30:38,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:30:38,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:30:38,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:30:38,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:30:38,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:30:38,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:30:38,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:30:38,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:30:38,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:30:38,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:30:38,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:30:38,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:30:38,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:30:38,260 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:30:38,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:30:38,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:30:38,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:30:38,261 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:30:38,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:30:38,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:30:38,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:30:38,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:30:38,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:30:38,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:30:38,263 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:30:38,263 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:30:38,263 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:30:38,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:30:38,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:30:38,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:30:38,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:30:38,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:30:38,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:30:38,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:30:38,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:30:38,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:30:38,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:30:38,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:30:38,264 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:30:38,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:30:38,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:30:38,265 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:30:38,265 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:30:38,266 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:30:38,266 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:30:38,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:30:38,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:30:38,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:30:38,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:30:38,523 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:30:38,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2022-01-10 23:30:38,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd5953e62/19fbac8ed49d480d95039ef33b94a7e4/FLAG59dda68f8 [2022-01-10 23:30:39,059 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:30:39,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2022-01-10 23:30:39,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd5953e62/19fbac8ed49d480d95039ef33b94a7e4/FLAG59dda68f8 [2022-01-10 23:30:39,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd5953e62/19fbac8ed49d480d95039ef33b94a7e4 [2022-01-10 23:30:39,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:30:39,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:30:39,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:30:39,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:30:39,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:30:39,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d3066a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39, skipping insertion in model container [2022-01-10 23:30:39,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:39,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:30:39,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:30:39,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-2.i[22632,22645] [2022-01-10 23:30:39,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:30:39,861 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:30:39,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-2.i[22632,22645] [2022-01-10 23:30:39,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:30:39,946 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:30:39,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39 WrapperNode [2022-01-10 23:30:39,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:30:39,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:30:39,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:30:39,949 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:30:39,955 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:30:39" (1/1) ... [2022-01-10 23:30:39,981 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:30:39" (1/1) ... [2022-01-10 23:30:40,027 INFO L137 Inliner]: procedures = 128, calls = 83, calls flagged for inlining = 21, calls inlined = 21, statements flattened = 349 [2022-01-10 23:30:40,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:30:40,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:30:40,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:30:40,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:30:40,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:40,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:40,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:40,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:40,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:40,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:40,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:40,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:30:40,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:30:40,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:30:40,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:30:40,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (1/1) ... [2022-01-10 23:30:40,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:30:40,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:40,124 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 23:30:40,150 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 23:30:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:30:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:30:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:30:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 23:30:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:30:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:30:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:30:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:30:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:30:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:30:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:30:40,265 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:30:40,266 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:30:41,035 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:30:41,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:30:41,043 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-01-10 23:30:41,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:30:41 BoogieIcfgContainer [2022-01-10 23:30:41,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:30:41,045 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:30:41,046 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:30:41,047 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:30:41,049 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:30:41" (1/1) ... [2022-01-10 23:30:41,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:30:41 BasicIcfg [2022-01-10 23:30:41,175 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:30:41,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:30:41,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:30:41,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:30:41,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:30:39" (1/4) ... [2022-01-10 23:30:41,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2dc829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:30:41, skipping insertion in model container [2022-01-10 23:30:41,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:30:39" (2/4) ... [2022-01-10 23:30:41,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2dc829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:30:41, skipping insertion in model container [2022-01-10 23:30:41,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:30:41" (3/4) ... [2022-01-10 23:30:41,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2dc829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:30:41, skipping insertion in model container [2022-01-10 23:30:41,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:30:41" (4/4) ... [2022-01-10 23:30:41,181 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-2.iTransformedIcfg [2022-01-10 23:30:41,185 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:30:41,186 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-01-10 23:30:41,222 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:30:41,228 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 23:30:41,228 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-01-10 23:30:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 100 states have (on average 1.74) internal successors, (174), 113 states have internal predecessors, (174), 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 23:30:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 23:30:41,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:41,247 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 23:30:41,247 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:41,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash 724477100, now seen corresponding path program 1 times [2022-01-10 23:30:41,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:41,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154982434] [2022-01-10 23:30:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:41,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,411 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 23:30:41,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:41,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154982434] [2022-01-10 23:30:41,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154982434] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:41,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:41,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:30:41,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586544102] [2022-01-10 23:30:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:41,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:30:41,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:41,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:30:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:30:41,453 INFO L87 Difference]: Start difference. First operand has 114 states, 100 states have (on average 1.74) internal successors, (174), 113 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:30:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:41,488 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2022-01-10 23:30:41,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:30:41,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-01-10 23:30:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:41,499 INFO L225 Difference]: With dead ends: 213 [2022-01-10 23:30:41,499 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 23:30:41,502 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 23:30:41,506 INFO L933 BasicCegarLoop]: 113 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, 113 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 23:30:41,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:30:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 23:30:41,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-01-10 23:30:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-01-10 23:30:41,543 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 6 [2022-01-10 23:30:41,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:41,544 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-01-10 23:30:41,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 23:30:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-01-10 23:30:41,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-10 23:30:41,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:41,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-10 23:30:41,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:30:41,545 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash 724506891, now seen corresponding path program 1 times [2022-01-10 23:30:41,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:41,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625854698] [2022-01-10 23:30:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:41,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,651 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 23:30:41,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:41,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625854698] [2022-01-10 23:30:41,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625854698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:41,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:41,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:30:41,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656476765] [2022-01-10 23:30:41,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:41,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:30:41,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:41,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:30:41,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:30:41,656 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:30:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:41,706 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2022-01-10 23:30:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:30:41,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-01-10 23:30:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:41,709 INFO L225 Difference]: With dead ends: 186 [2022-01-10 23:30:41,709 INFO L226 Difference]: Without dead ends: 99 [2022-01-10 23:30:41,714 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 23:30:41,715 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:41,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 200 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:30:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-10 23:30:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-01-10 23:30:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 94 states have internal predecessors, (105), 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 23:30:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2022-01-10 23:30:41,730 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 6 [2022-01-10 23:30:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:41,733 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2022-01-10 23:30:41,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:30:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2022-01-10 23:30:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 23:30:41,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:41,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:41,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:30:41,734 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:41,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:41,735 INFO L85 PathProgramCache]: Analyzing trace with hash 646505733, now seen corresponding path program 1 times [2022-01-10 23:30:41,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:41,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579119467] [2022-01-10 23:30:41,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:41,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:41,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:41,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579119467] [2022-01-10 23:30:41,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579119467] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:41,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:41,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:30:41,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584962198] [2022-01-10 23:30:41,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:41,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:30:41,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:41,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:30:41,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:41,921 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:42,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:42,124 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2022-01-10 23:30:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:30:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 23:30:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:42,133 INFO L225 Difference]: With dead ends: 261 [2022-01-10 23:30:42,134 INFO L226 Difference]: Without dead ends: 255 [2022-01-10 23:30:42,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 23:30:42,141 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 598 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:42,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [598 Valid, 224 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:30:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-10 23:30:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 97. [2022-01-10 23:30:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 96 states have internal predecessors, (108), 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 23:30:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2022-01-10 23:30:42,155 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 11 [2022-01-10 23:30:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:42,155 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2022-01-10 23:30:42,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2022-01-10 23:30:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 23:30:42,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:42,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:42,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:30:42,157 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:42,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash -599541375, now seen corresponding path program 1 times [2022-01-10 23:30:42,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:42,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888338672] [2022-01-10 23:30:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:42,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:42,360 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 23:30:42,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:42,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888338672] [2022-01-10 23:30:42,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888338672] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:42,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:42,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:30:42,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158606150] [2022-01-10 23:30:42,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:42,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:30:42,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:42,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:30:42,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:42,362 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:42,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:42,689 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-01-10 23:30:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:42,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 23:30:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:42,691 INFO L225 Difference]: With dead ends: 126 [2022-01-10 23:30:42,691 INFO L226 Difference]: Without dead ends: 124 [2022-01-10 23:30:42,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:30:42,693 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 45 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:42,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 277 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 23:30:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-10 23:30:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2022-01-10 23:30:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 94 states have internal predecessors, (106), 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 23:30:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2022-01-10 23:30:42,702 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 18 [2022-01-10 23:30:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:42,702 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2022-01-10 23:30:42,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2022-01-10 23:30:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 23:30:42,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:42,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:42,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:30:42,706 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash -566109944, now seen corresponding path program 1 times [2022-01-10 23:30:42,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:42,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253383908] [2022-01-10 23:30:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:42,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:42,872 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 23:30:42,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:42,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253383908] [2022-01-10 23:30:42,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253383908] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:42,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:42,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:30:42,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947158120] [2022-01-10 23:30:42,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:42,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:30:42,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:42,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:30:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:42,877 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:43,120 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-01-10 23:30:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 23:30:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:43,122 INFO L225 Difference]: With dead ends: 95 [2022-01-10 23:30:43,122 INFO L226 Difference]: Without dead ends: 93 [2022-01-10 23:30:43,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:30:43,123 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 14 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:43,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 288 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:30:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-10 23:30:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-01-10 23:30:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 92 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2022-01-10 23:30:43,129 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 18 [2022-01-10 23:30:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:43,130 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2022-01-10 23:30:43,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2022-01-10 23:30:43,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:30:43,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:43,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:43,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 23:30:43,135 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1833338600, now seen corresponding path program 1 times [2022-01-10 23:30:43,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:43,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243649259] [2022-01-10 23:30:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:43,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:43,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:43,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243649259] [2022-01-10 23:30:43,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243649259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:43,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:43,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 23:30:43,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48202088] [2022-01-10 23:30:43,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:43,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 23:30:43,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 23:30:43,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:30:43,268 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 7 states, 7 states have (on average 3.0) 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 23:30:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:43,600 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2022-01-10 23:30:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:30:43,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) 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 21 [2022-01-10 23:30:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:43,601 INFO L225 Difference]: With dead ends: 212 [2022-01-10 23:30:43,601 INFO L226 Difference]: Without dead ends: 210 [2022-01-10 23:30:43,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-10 23:30:43,602 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 582 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:43,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [582 Valid, 252 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 23:30:43,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-10 23:30:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 99. [2022-01-10 23:30:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2022-01-10 23:30:43,612 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 21 [2022-01-10 23:30:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:43,612 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2022-01-10 23:30:43,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) 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 23:30:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2022-01-10 23:30:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:30:43,613 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:43,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:43,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 23:30:43,613 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1356691910, now seen corresponding path program 1 times [2022-01-10 23:30:43,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:43,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426931844] [2022-01-10 23:30:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:43,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:43,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:43,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426931844] [2022-01-10 23:30:43,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426931844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:43,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:43,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 23:30:43,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557267812] [2022-01-10 23:30:43,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:43,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 23:30:43,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 23:30:43,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:30:43,779 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 7 states, 7 states have (on average 3.0) 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 23:30:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:44,149 INFO L93 Difference]: Finished difference Result 210 states and 230 transitions. [2022-01-10 23:30:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:30:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) 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 21 [2022-01-10 23:30:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:44,151 INFO L225 Difference]: With dead ends: 210 [2022-01-10 23:30:44,151 INFO L226 Difference]: Without dead ends: 208 [2022-01-10 23:30:44,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-10 23:30:44,152 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 395 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:44,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 253 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 23:30:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-10 23:30:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 105. [2022-01-10 23:30:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 104 states have internal predecessors, (116), 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 23:30:44,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-01-10 23:30:44,166 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 21 [2022-01-10 23:30:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:44,167 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-01-10 23:30:44,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) 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 23:30:44,167 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-01-10 23:30:44,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 23:30:44,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:44,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:44,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 23:30:44,168 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:44,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2107399474, now seen corresponding path program 1 times [2022-01-10 23:30:44,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:44,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909502393] [2022-01-10 23:30:44,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:44,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:44,409 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 23:30:44,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:44,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909502393] [2022-01-10 23:30:44,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909502393] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:44,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271828340] [2022-01-10 23:30:44,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:44,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:44,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:44,412 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 23:30:44,431 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 23:30:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:44,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-10 23:30:44,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:44,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:30:44,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:44,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:30:44,796 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:30:44,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-01-10 23:30:44,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:44,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:30:44,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:44,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-01-10 23:30:44,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:44,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2022-01-10 23:30:45,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:45,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:45,672 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-10 23:30:45,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 45 [2022-01-10 23:30:45,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:45,689 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-10 23:30:45,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2022-01-10 23:30:45,717 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 23:30:45,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:30:46,375 INFO L353 Elim1Store]: treesize reduction 306, result has 14.0 percent of original size [2022-01-10 23:30:46,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37782 treesize of output 29192 [2022-01-10 23:30:46,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:46,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:46,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:46,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:46,896 INFO L353 Elim1Store]: treesize reduction 53, result has 28.4 percent of original size [2022-01-10 23:30:46,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34543 treesize of output 24905 [2022-01-10 23:30:47,256 INFO L353 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-01-10 23:30:47,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24733 treesize of output 23547 [2022-01-10 23:30:47,487 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:30:47,488 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 23513 treesize of output 22293 [2022-01-10 23:30:47,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:47,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:47,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15601 treesize of output 15407 [2022-01-10 23:30:47,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:30:47,823 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 3657 treesize of output 3655 [2022-01-10 23:30:47,961 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 23:30:47,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:30:47,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-01-10 23:30:47,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440522528] [2022-01-10 23:30:47,961 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 23:30:47,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 23:30:47,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 23:30:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-01-10 23:30:47,962 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 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 23:30:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:48,871 INFO L93 Difference]: Finished difference Result 285 states and 321 transitions. [2022-01-10 23:30:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 23:30:48,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 23:30:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:48,877 INFO L225 Difference]: With dead ends: 285 [2022-01-10 23:30:48,877 INFO L226 Difference]: Without dead ends: 283 [2022-01-10 23:30:48,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2022-01-10 23:30:48,878 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 771 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:48,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [771 Valid, 397 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 23:30:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-01-10 23:30:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 108. [2022-01-10 23:30:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 107 states have internal predecessors, (119), 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 23:30:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2022-01-10 23:30:48,888 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 24 [2022-01-10 23:30:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:48,888 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2022-01-10 23:30:48,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 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 23:30:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-01-10 23:30:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 23:30:48,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:48,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:48,914 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 23:30:49,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:49,114 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:49,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:49,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1567914551, now seen corresponding path program 1 times [2022-01-10 23:30:49,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:49,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007633621] [2022-01-10 23:30:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:49,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:49,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:49,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007633621] [2022-01-10 23:30:49,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007633621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:49,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:49,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 23:30:49,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618135148] [2022-01-10 23:30:49,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:49,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 23:30:49,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:49,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 23:30:49,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 23:30:49,334 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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 23:30:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:50,152 INFO L93 Difference]: Finished difference Result 283 states and 319 transitions. [2022-01-10 23:30:50,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 23:30:50,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 23:30:50,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:50,154 INFO L225 Difference]: With dead ends: 283 [2022-01-10 23:30:50,154 INFO L226 Difference]: Without dead ends: 281 [2022-01-10 23:30:50,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-01-10 23:30:50,155 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 579 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:50,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 357 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 23:30:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-01-10 23:30:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 111. [2022-01-10 23:30:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 110 states have internal predecessors, (122), 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 23:30:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-01-10 23:30:50,163 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 24 [2022-01-10 23:30:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:50,163 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-01-10 23:30:50,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 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 23:30:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-01-10 23:30:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 23:30:50,164 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:50,165 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:50,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 23:30:50,165 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash -844446883, now seen corresponding path program 1 times [2022-01-10 23:30:50,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:50,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37530568] [2022-01-10 23:30:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:50,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:30:50,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:50,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37530568] [2022-01-10 23:30:50,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37530568] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:50,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780303352] [2022-01-10 23:30:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:50,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:50,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:50,259 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 23:30:50,260 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 23:30:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:50,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 23:30:50,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:50,544 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 37 treesize of output 21 [2022-01-10 23:30:50,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-10 23:30:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:30:50,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:30:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:30:50,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780303352] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:30:50,820 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:30:50,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-10 23:30:50,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774814938] [2022-01-10 23:30:50,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:30:50,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 23:30:50,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:50,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 23:30:50,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 23:30:50,822 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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 23:30:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:51,271 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-01-10 23:30:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:51,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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) Word has length 29 [2022-01-10 23:30:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:51,272 INFO L225 Difference]: With dead ends: 111 [2022-01-10 23:30:51,272 INFO L226 Difference]: Without dead ends: 107 [2022-01-10 23:30:51,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-10 23:30:51,273 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 96 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:51,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 364 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 23:30:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-10 23:30:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-01-10 23:30:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 99 states have (on average 1.1919191919191918) internal successors, (118), 106 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2022-01-10 23:30:51,280 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 29 [2022-01-10 23:30:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:51,281 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2022-01-10 23:30:51,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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 23:30:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2022-01-10 23:30:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 23:30:51,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:51,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:51,306 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 23:30:51,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 23:30:51,494 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:51,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2127250108, now seen corresponding path program 1 times [2022-01-10 23:30:51,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:51,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217360185] [2022-01-10 23:30:51,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:51,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:51,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:51,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217360185] [2022-01-10 23:30:51,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217360185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:51,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:51,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:30:51,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324381702] [2022-01-10 23:30:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:51,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:30:51,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:51,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:30:51,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:51,565 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:51,618 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2022-01-10 23:30:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:30:51,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 23:30:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:51,619 INFO L225 Difference]: With dead ends: 151 [2022-01-10 23:30:51,619 INFO L226 Difference]: Without dead ends: 149 [2022-01-10 23:30:51,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:30:51,620 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 224 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:51,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 224 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:30:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-01-10 23:30:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 111. [2022-01-10 23:30:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 110 states have internal predecessors, (123), 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 23:30:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-01-10 23:30:51,629 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 30 [2022-01-10 23:30:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:51,629 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-01-10 23:30:51,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-01-10 23:30:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 23:30:51,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:51,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:51,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 23:30:51,630 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:51,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash -663995329, now seen corresponding path program 1 times [2022-01-10 23:30:51,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:51,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642952048] [2022-01-10 23:30:51,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:51,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:52,019 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 23:30:52,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:52,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642952048] [2022-01-10 23:30:52,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642952048] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:52,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408479900] [2022-01-10 23:30:52,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:52,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:52,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:52,024 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 23:30:52,025 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 23:30:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:52,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-10 23:30:52,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:52,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:52,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:30:52,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:52,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:30:52,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:30:52,553 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 23:30:52,573 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 23:30:52,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:30:53,019 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 23:30:53,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408479900] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:30:53,019 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:30:53,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 17 [2022-01-10 23:30:53,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596891594] [2022-01-10 23:30:53,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:30:53,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 23:30:53,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 23:30:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-01-10 23:30:53,021 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 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 23:30:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:54,077 INFO L93 Difference]: Finished difference Result 251 states and 283 transitions. [2022-01-10 23:30:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 23:30:54,078 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 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 33 [2022-01-10 23:30:54,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:54,079 INFO L225 Difference]: With dead ends: 251 [2022-01-10 23:30:54,079 INFO L226 Difference]: Without dead ends: 249 [2022-01-10 23:30:54,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2022-01-10 23:30:54,080 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 266 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:54,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 736 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 23:30:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-01-10 23:30:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 174. [2022-01-10 23:30:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 166 states have (on average 1.1686746987951808) internal successors, (194), 173 states have internal predecessors, (194), 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 23:30:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 194 transitions. [2022-01-10 23:30:54,092 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 194 transitions. Word has length 33 [2022-01-10 23:30:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:54,092 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 194 transitions. [2022-01-10 23:30:54,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 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 23:30:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 194 transitions. [2022-01-10 23:30:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 23:30:54,093 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:54,093 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:54,122 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 23:30:54,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:54,294 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1655891077, now seen corresponding path program 1 times [2022-01-10 23:30:54,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:54,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505632406] [2022-01-10 23:30:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:54,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:54,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:54,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505632406] [2022-01-10 23:30:54,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505632406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:54,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:54,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:30:54,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840585858] [2022-01-10 23:30:54,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:54,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:30:54,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:54,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:30:54,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:30:54,351 INFO L87 Difference]: Start difference. First operand 174 states and 194 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:54,462 INFO L93 Difference]: Finished difference Result 288 states and 331 transitions. [2022-01-10 23:30:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:30:54,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-10 23:30:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:54,464 INFO L225 Difference]: With dead ends: 288 [2022-01-10 23:30:54,465 INFO L226 Difference]: Without dead ends: 248 [2022-01-10 23:30:54,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 23:30:54,465 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 293 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:54,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 266 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:30:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-01-10 23:30:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 175. [2022-01-10 23:30:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 167 states have (on average 1.1676646706586826) internal successors, (195), 174 states have internal predecessors, (195), 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 23:30:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2022-01-10 23:30:54,478 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 35 [2022-01-10 23:30:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:54,478 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2022-01-10 23:30:54,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2022-01-10 23:30:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 23:30:54,479 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:54,479 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:54,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 23:30:54,480 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash -3554066, now seen corresponding path program 1 times [2022-01-10 23:30:54,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:54,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700811005] [2022-01-10 23:30:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:54,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:54,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:54,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700811005] [2022-01-10 23:30:54,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700811005] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:54,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689710134] [2022-01-10 23:30:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:54,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:54,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:54,713 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 23:30:54,715 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 23:30:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:54,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-10 23:30:54,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:55,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:55,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:30:55,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:30:55,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:30:55,185 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 34 treesize of output 10 [2022-01-10 23:30:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:55,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:30:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:55,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689710134] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:30:55,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:30:55,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-01-10 23:30:55,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998215752] [2022-01-10 23:30:55,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:30:55,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 23:30:55,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:55,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 23:30:55,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-01-10 23:30:55,469 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:56,607 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2022-01-10 23:30:56,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:30:56,608 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-10 23:30:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:56,608 INFO L225 Difference]: With dead ends: 260 [2022-01-10 23:30:56,609 INFO L226 Difference]: Without dead ends: 168 [2022-01-10 23:30:56,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-01-10 23:30:56,609 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 307 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:56,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 670 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 23:30:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-01-10 23:30:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2022-01-10 23:30:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 133 states have (on average 1.1654135338345866) internal successors, (155), 140 states have internal predecessors, (155), 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 23:30:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-01-10 23:30:56,621 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 35 [2022-01-10 23:30:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:56,621 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-01-10 23:30:56,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-01-10 23:30:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 23:30:56,622 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:56,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:56,649 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 23:30:56,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:56,835 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1536049710, now seen corresponding path program 1 times [2022-01-10 23:30:56,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:56,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255183885] [2022-01-10 23:30:56,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:56,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:57,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:57,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:57,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255183885] [2022-01-10 23:30:57,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255183885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:57,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:57,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 23:30:57,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055545584] [2022-01-10 23:30:57,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:57,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 23:30:57,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:57,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 23:30:57,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-10 23:30:57,047 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:57,568 INFO L93 Difference]: Finished difference Result 190 states and 207 transitions. [2022-01-10 23:30:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 23:30:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 23:30:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:57,569 INFO L225 Difference]: With dead ends: 190 [2022-01-10 23:30:57,569 INFO L226 Difference]: Without dead ends: 188 [2022-01-10 23:30:57,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-10 23:30:57,570 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 465 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:57,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 470 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 23:30:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-01-10 23:30:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 153. [2022-01-10 23:30:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 145 states have (on average 1.1655172413793105) internal successors, (169), 152 states have internal predecessors, (169), 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 23:30:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2022-01-10 23:30:57,583 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 36 [2022-01-10 23:30:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:57,583 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2022-01-10 23:30:57,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2022-01-10 23:30:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 23:30:57,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:57,584 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:57,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 23:30:57,585 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:57,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2098417675, now seen corresponding path program 1 times [2022-01-10 23:30:57,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:57,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397439381] [2022-01-10 23:30:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:57,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 23:30:57,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:57,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397439381] [2022-01-10 23:30:57,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397439381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:57,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:30:57,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 23:30:57,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283944789] [2022-01-10 23:30:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:57,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 23:30:57,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:57,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 23:30:57,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 23:30:57,674 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:57,932 INFO L93 Difference]: Finished difference Result 303 states and 352 transitions. [2022-01-10 23:30:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 23:30:57,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 23:30:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:57,934 INFO L225 Difference]: With dead ends: 303 [2022-01-10 23:30:57,934 INFO L226 Difference]: Without dead ends: 263 [2022-01-10 23:30:57,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-01-10 23:30:57,935 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 443 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:57,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 542 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:30:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-01-10 23:30:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 168. [2022-01-10 23:30:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 160 states have (on average 1.19375) internal successors, (191), 167 states have internal predecessors, (191), 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 23:30:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 191 transitions. [2022-01-10 23:30:57,950 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 191 transitions. Word has length 36 [2022-01-10 23:30:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:57,950 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 191 transitions. [2022-01-10 23:30:57,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:30:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 191 transitions. [2022-01-10 23:30:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 23:30:57,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:57,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:57,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 23:30:57,951 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:57,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2053948421, now seen corresponding path program 2 times [2022-01-10 23:30:57,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:57,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068421326] [2022-01-10 23:30:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:57,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:58,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:58,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068421326] [2022-01-10 23:30:58,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068421326] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:58,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901614118] [2022-01-10 23:30:58,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:30:58,205 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:58,208 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 23:30:58,233 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 23:30:58,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 23:30:58,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:30:58,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 23:30:58,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:58,513 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 34 treesize of output 10 [2022-01-10 23:30:58,517 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 34 treesize of output 10 [2022-01-10 23:30:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 23:30:58,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:30:58,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901614118] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:30:58,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:30:58,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-01-10 23:30:58,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775084761] [2022-01-10 23:30:58,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:30:58,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:30:58,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:30:58,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:30:58,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-01-10 23:30:58,552 INFO L87 Difference]: Start difference. First operand 168 states and 191 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 23:30:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:30:58,865 INFO L93 Difference]: Finished difference Result 168 states and 191 transitions. [2022-01-10 23:30:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:30:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 38 [2022-01-10 23:30:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:30:58,866 INFO L225 Difference]: With dead ends: 168 [2022-01-10 23:30:58,866 INFO L226 Difference]: Without dead ends: 166 [2022-01-10 23:30:58,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-01-10 23:30:58,867 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 37 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 23:30:58,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 306 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 23:30:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-01-10 23:30:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 147. [2022-01-10 23:30:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 140 states have (on average 1.2) internal successors, (168), 146 states have internal predecessors, (168), 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 23:30:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 168 transitions. [2022-01-10 23:30:58,880 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 168 transitions. Word has length 38 [2022-01-10 23:30:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:30:58,880 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 168 transitions. [2022-01-10 23:30:58,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 23:30:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 168 transitions. [2022-01-10 23:30:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 23:30:58,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:30:58,881 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:30:58,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 23:30:59,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-10 23:30:59,096 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:30:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:30:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 600273716, now seen corresponding path program 2 times [2022-01-10 23:30:59,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:30:59,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646386060] [2022-01-10 23:30:59,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:30:59,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:30:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:30:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:30:59,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:30:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646386060] [2022-01-10 23:30:59,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646386060] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:30:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010965670] [2022-01-10 23:30:59,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:30:59,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:30:59,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:30:59,525 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 23:30:59,526 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 23:30:59,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:30:59,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:30:59,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-10 23:30:59,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:30:59,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:31:00,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:00,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:31:00,059 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:31:00,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-01-10 23:31:00,110 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 15 treesize of output 17 [2022-01-10 23:31:00,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:00,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:00,196 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 23:31:00,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-01-10 23:31:00,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:00,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:00,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:31:00,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:00,819 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 65 treesize of output 29 [2022-01-10 23:31:01,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:01,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:01,176 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:31:01,176 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 23 [2022-01-10 23:31:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:31:01,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:31:01,585 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-01-10 23:31:01,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:03,084 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| Int) (v_ArrVal_660 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt| v_ArrVal_660))) (let ((.cse1 (store (store (select .cse0 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| v_ArrVal_665) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|))) (or (not (= (select (select (store .cse0 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| .cse1) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| 0)) (and (= (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|)))))) is different from false [2022-01-10 23:31:03,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt_5| Int) (v_ArrVal_660 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt_5| v_ArrVal_660))) (let ((.cse1 (store (store (select .cse2 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| v_ArrVal_665) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|)) (.cse0 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt_5|))) (or (not (<= .cse0 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| 0)) (= (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 0) (not (= (select (select (store .cse2 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| .cse1) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) 0)) (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|)))))) is different from false [2022-01-10 23:31:03,282 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 23:31:03,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 70 [2022-01-10 23:31:03,295 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:31:03,295 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 392 treesize of output 380 [2022-01-10 23:31:03,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:31:03,310 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 526 treesize of output 510 [2022-01-10 23:31:03,782 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 104 treesize of output 102 [2022-01-10 23:31:03,857 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 81 treesize of output 75 [2022-01-10 23:31:04,180 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 25 treesize of output 21 [2022-01-10 23:31:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-10 23:31:04,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010965670] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:31:04,197 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:31:04,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2022-01-10 23:31:04,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229274983] [2022-01-10 23:31:04,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:31:04,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-10 23:31:04,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-10 23:31:04,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=894, Unknown=2, NotChecked=122, Total=1122 [2022-01-10 23:31:04,200 INFO L87 Difference]: Start difference. First operand 147 states and 168 transitions. Second operand has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 34 states have internal predecessors, (113), 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 23:31:04,436 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|))) (let ((.cse1 (not (= (select .cse2 0) 0))) (.cse0 (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt|)) (= .cse0 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt|) .cse1 (<= |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| 0) (not (= (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) 0)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt| 0)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt|) (or .cse1 (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|)) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| Int) (v_ArrVal_660 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt| v_ArrVal_660))) (let ((.cse4 (store (store (select .cse3 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| v_ArrVal_665) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|))) (or (not (= (select (select (store .cse3 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| .cse4) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| 0)) (and (= (select .cse4 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|)))))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|) 1) (= (select |c_#validInt| 1) 1) (not (= .cse0 0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| 0)))) is different from false [2022-01-10 23:31:04,503 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt| 0) (not (= (select .cse0 0) 0)) (not (= (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) 0)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt| 0)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt|) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| Int) (v_ArrVal_660 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt| v_ArrVal_660))) (let ((.cse2 (store (store (select .cse1 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| v_ArrVal_665) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|))) (or (not (= (select (select (store .cse1 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| .cse2) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| 0)) (and (= (select .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|)))))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0))) is different from false [2022-01-10 23:31:04,687 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|)) (.cse1 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|)) (.cse6 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt| 8) 18446744073709551616))) (let ((.cse2 (select .cse1 .cse6)) (.cse4 (not (= (select .cse3 0) 0))) (.cse0 (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt|)) (= .cse0 1) (= (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt| 0) (<= 0 .cse2) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt|) (not (= (select (select |c_#memory_$Pointer$.baseInt| (select .cse3 8)) 0) 0)) .cse4 (let ((.cse5 (select .cse3 .cse6))) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt| .cse5) (not (= (select (select |c_#memory_$Pointer$.baseInt| .cse5) .cse2) 0)))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| 0) (not (= (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) 0)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0) (<= .cse2 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt| 0)) (= (select .cse1 8) 0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt|) (or .cse4 (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|)) (forall ((v_ArrVal_665 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| Int) (v_ArrVal_660 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| Int)) (let ((.cse7 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt| v_ArrVal_660))) (let ((.cse8 (store (store (select .cse7 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| v_ArrVal_665) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|))) (or (not (= (select (select (store .cse7 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| .cse8) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6| 0)) (and (= (select .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|) 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_6|)))))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.offsetInt| 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|) 1) (not (= .cse0 0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| 0)))) is different from false [2022-01-10 23:31:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:06,722 INFO L93 Difference]: Finished difference Result 351 states and 416 transitions. [2022-01-10 23:31:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-10 23:31:06,722 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 34 states have internal predecessors, (113), 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 40 [2022-01-10 23:31:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:06,724 INFO L225 Difference]: With dead ends: 351 [2022-01-10 23:31:06,724 INFO L226 Difference]: Without dead ends: 349 [2022-01-10 23:31:06,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=395, Invalid=1782, Unknown=5, NotChecked=470, Total=2652 [2022-01-10 23:31:06,725 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 1488 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 503 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:06,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 1357 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 727 Invalid, 0 Unknown, 503 Unchecked, 1.4s Time] [2022-01-10 23:31:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-01-10 23:31:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 158. [2022-01-10 23:31:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 151 states have (on average 1.1920529801324504) internal successors, (180), 157 states have internal predecessors, (180), 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 23:31:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2022-01-10 23:31:06,741 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 40 [2022-01-10 23:31:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:06,741 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2022-01-10 23:31:06,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 34 states have internal predecessors, (113), 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 23:31:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2022-01-10 23:31:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 23:31:06,743 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:06,743 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:06,768 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 23:31:06,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-10 23:31:06,960 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:31:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash 123627026, now seen corresponding path program 1 times [2022-01-10 23:31:06,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:06,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759063538] [2022-01-10 23:31:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:06,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:31:07,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:07,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759063538] [2022-01-10 23:31:07,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759063538] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:31:07,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525218647] [2022-01-10 23:31:07,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:07,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:07,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:31:07,367 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 23:31:07,368 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 23:31:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:07,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-10 23:31:07,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:31:07,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:31:07,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:07,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:31:08,008 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 23:31:08,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2022-01-10 23:31:08,069 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 15 treesize of output 17 [2022-01-10 23:31:08,080 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:31:08,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-01-10 23:31:08,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:08,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2022-01-10 23:31:08,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:08,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 23:31:08,553 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 58 treesize of output 26 [2022-01-10 23:31:08,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:31:08,884 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:31:08,884 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 15 [2022-01-10 23:31:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:31:08,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:31:09,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8| Int) (v_ArrVal_774 Int) (v_ArrVal_768 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_9| Int)) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt| v_ArrVal_768))) (store .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_9| (store (store (select .cse2 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_9|) |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8| v_ArrVal_774) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|)) (.cse1 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_9|))) (or (not (<= 0 .cse0)) (not (<= .cse1 0)) (<= 1 .cse0) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8|)) (not (<= 0 .cse1)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8| 0))))) is different from false [2022-01-10 23:31:09,531 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt_7| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8| Int) (v_ArrVal_774 Int) (v_ArrVal_768 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_9| Int) (v_ArrVal_767 Int)) (let ((.cse0 (select (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt_7| v_ArrVal_767) |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_9|)) (.cse1 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt_7|)) (.cse2 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~node~1#1.baseInt_7| v_ArrVal_768))) (store .cse3 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_9| (store (store (select .cse3 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_9|) |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8| v_ArrVal_774) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8|) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1.offsetInt|))) (or (not (<= .cse0 0)) (not (<= .cse1 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8|)) (not (<= 0 .cse0)) (not (<= 0 .cse1)) (not (<= 0 .cse2)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt_8| 0)) (<= 1 .cse2)))) is different from false [2022-01-10 23:31:09,578 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 23:31:09,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 78 [2022-01-10 23:31:09,594 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:31:09,595 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 508 treesize of output 486 [2022-01-10 23:31:09,611 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 658 treesize of output 638 [2022-01-10 23:31:09,835 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 1364 treesize of output 1332 [2022-01-10 23:31:24,838 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 338 treesize of output 320 [2022-01-10 23:31:27,829 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:31:27,830 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 106 treesize of output 102 [2022-01-10 23:31:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-10 23:31:27,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525218647] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:31:27,890 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:31:27,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-01-10 23:31:27,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203041682] [2022-01-10 23:31:27,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:31:27,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 23:31:27,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 23:31:27,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=627, Unknown=2, NotChecked=102, Total=812 [2022-01-10 23:31:27,892 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand has 29 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 29 states have internal predecessors, (112), 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 23:31:29,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:29,734 INFO L93 Difference]: Finished difference Result 334 states and 388 transitions. [2022-01-10 23:31:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 23:31:29,735 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 29 states have internal predecessors, (112), 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 40 [2022-01-10 23:31:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:29,736 INFO L225 Difference]: With dead ends: 334 [2022-01-10 23:31:29,736 INFO L226 Difference]: Without dead ends: 332 [2022-01-10 23:31:29,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=280, Invalid=1208, Unknown=2, NotChecked=150, Total=1640 [2022-01-10 23:31:29,737 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 883 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:29,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [883 Valid, 1464 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 709 Invalid, 0 Unknown, 534 Unchecked, 1.0s Time] [2022-01-10 23:31:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-01-10 23:31:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 165. [2022-01-10 23:31:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 158 states have (on average 1.1835443037974684) internal successors, (187), 164 states have internal predecessors, (187), 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 23:31:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2022-01-10 23:31:29,754 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 40 [2022-01-10 23:31:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:29,754 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2022-01-10 23:31:29,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.8620689655172415) internal successors, (112), 29 states have internal predecessors, (112), 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 23:31:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2022-01-10 23:31:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 23:31:29,755 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:29,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:29,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 23:31:29,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:31:29,964 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:31:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2002420255, now seen corresponding path program 1 times [2022-01-10 23:31:29,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:29,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165443646] [2022-01-10 23:31:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:29,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:31:30,042 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 23:31:30,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:31:30,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165443646] [2022-01-10 23:31:30,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165443646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:31:30,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:31:30,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:31:30,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084744259] [2022-01-10 23:31:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:31:30,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:31:30,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:31:30,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:31:30,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:31:30,044 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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 23:31:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:31:30,206 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2022-01-10 23:31:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 23:31:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 23:31:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:31:30,207 INFO L225 Difference]: With dead ends: 165 [2022-01-10 23:31:30,207 INFO L226 Difference]: Without dead ends: 148 [2022-01-10 23:31:30,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:31:30,208 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:31:30,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 291 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:31:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-01-10 23:31:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-01-10 23:31:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 142 states have (on average 1.1830985915492958) internal successors, (168), 147 states have internal predecessors, (168), 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 23:31:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2022-01-10 23:31:30,223 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 42 [2022-01-10 23:31:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:31:30,223 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2022-01-10 23:31:30,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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 23:31:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2022-01-10 23:31:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 23:31:30,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:31:30,224 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:31:30,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 23:31:30,224 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 23:31:30,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:31:30,224 INFO L85 PathProgramCache]: Analyzing trace with hash -441490507, now seen corresponding path program 1 times [2022-01-10 23:31:30,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:31:30,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795158021] [2022-01-10 23:31:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:31:30,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:31:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat