/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 09:11:01,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 09:11:01,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 09:11:01,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 09:11:01,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 09:11:01,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 09:11:01,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 09:11:01,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 09:11:01,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 09:11:01,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 09:11:01,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 09:11:01,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 09:11:01,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 09:11:01,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 09:11:01,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 09:11:01,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 09:11:01,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 09:11:01,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 09:11:01,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 09:11:01,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 09:11:01,277 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 09:11:01,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 09:11:01,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 09:11:01,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 09:11:01,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 09:11:01,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 09:11:01,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 09:11:01,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 09:11:01,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 09:11:01,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 09:11:01,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 09:11:01,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 09:11:01,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 09:11:01,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 09:11:01,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 09:11:01,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 09:11:01,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 09:11:01,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 09:11:01,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 09:11:01,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 09:11:01,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 09:11:01,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 09:11:01,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 09:11:01,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 09:11:01,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 09:11:01,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 09:11:01,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 09:11:01,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 09:11:01,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 09:11:01,303 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 09:11:01,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 09:11:01,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 09:11:01,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 09:11:01,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:11:01,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 09:11:01,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 09:11:01,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 09:11:01,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 09:11:01,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 09:11:01,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 09:11:01,305 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 09:11:01,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 09:11:01,306 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 09:11:01,306 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-04-06 09:11:01,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 09:11:01,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 09:11:01,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 09:11:01,513 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 09:11:01,519 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 09:11:01,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2022-04-06 09:11:01,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1e987d1/752a1baaa99246179d635a8832a8197e/FLAG268093301 [2022-04-06 09:11:01,941 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 09:11:01,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2022-04-06 09:11:01,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1e987d1/752a1baaa99246179d635a8832a8197e/FLAG268093301 [2022-04-06 09:11:01,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c1e987d1/752a1baaa99246179d635a8832a8197e [2022-04-06 09:11:01,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 09:11:01,963 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 09:11:01,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 09:11:01,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 09:11:01,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 09:11:01,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:11:01" (1/1) ... [2022-04-06 09:11:01,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a5e423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:01, skipping insertion in model container [2022-04-06 09:11:01,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:11:01" (1/1) ... [2022-04-06 09:11:01,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 09:11:01,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 09:11:02,113 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-04-06 09:11:02,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:11:02,135 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 09:11:02,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-04-06 09:11:02,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:11:02,154 INFO L208 MainTranslator]: Completed translation [2022-04-06 09:11:02,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02 WrapperNode [2022-04-06 09:11:02,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 09:11:02,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 09:11:02,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 09:11:02,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 09:11:02,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02" (1/1) ... [2022-04-06 09:11:02,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02" (1/1) ... [2022-04-06 09:11:02,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02" (1/1) ... [2022-04-06 09:11:02,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02" (1/1) ... [2022-04-06 09:11:02,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02" (1/1) ... [2022-04-06 09:11:02,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02" (1/1) ... [2022-04-06 09:11:02,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02" (1/1) ... [2022-04-06 09:11:02,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 09:11:02,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 09:11:02,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 09:11:02,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 09:11:02,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02" (1/1) ... [2022-04-06 09:11:02,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:11:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:02,204 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-04-06 09:11:02,211 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-04-06 09:11:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 09:11:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 09:11:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 09:11:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 09:11:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2022-04-06 09:11:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 09:11:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 09:11:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 09:11:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 09:11:02,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 09:11:02,283 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 09:11:02,284 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 09:11:02,421 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 09:11:02,426 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 09:11:02,426 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-06 09:11:02,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:11:02 BoogieIcfgContainer [2022-04-06 09:11:02,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 09:11:02,429 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 09:11:02,429 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 09:11:02,430 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 09:11:02,433 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:11:02" (1/1) ... [2022-04-06 09:11:02,435 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 09:11:02,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:11:02 BasicIcfg [2022-04-06 09:11:02,449 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 09:11:02,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 09:11:02,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 09:11:02,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 09:11:02,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:11:01" (1/4) ... [2022-04-06 09:11:02,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9a8ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:11:02, skipping insertion in model container [2022-04-06 09:11:02,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:11:02" (2/4) ... [2022-04-06 09:11:02,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9a8ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:11:02, skipping insertion in model container [2022-04-06 09:11:02,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:11:02" (3/4) ... [2022-04-06 09:11:02,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9a8ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:11:02, skipping insertion in model container [2022-04-06 09:11:02,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:11:02" (4/4) ... [2022-04-06 09:11:02,455 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.iqvasr [2022-04-06 09:11:02,458 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 09:11:02,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 09:11:02,495 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 09:11:02,499 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-06 09:11:02,499 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 09:11:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 09:11:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 09:11:02,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:02,522 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:02,522 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1326105583, now seen corresponding path program 1 times [2022-04-06 09:11:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:02,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644622619] [2022-04-06 09:11:02,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:02,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-06 09:11:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:11:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:02,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644622619] [2022-04-06 09:11:02,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644622619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:11:02,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:11:02,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 09:11:02,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754988386] [2022-04-06 09:11:02,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:11:02,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 09:11:02,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 09:11:02,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 09:11:02,732 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 09:11:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:02,848 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2022-04-06 09:11:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 09:11:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-06 09:11:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:02,856 INFO L225 Difference]: With dead ends: 77 [2022-04-06 09:11:02,857 INFO L226 Difference]: Without dead ends: 43 [2022-04-06 09:11:02,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:11:02,861 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:02,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 30 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:11:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-06 09:11:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-04-06 09:11:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-04-06 09:11:02,888 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-04-06 09:11:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:02,888 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-04-06 09:11:02,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 09:11:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-06 09:11:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 09:11:02,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:02,889 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:02,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 09:11:02,890 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:02,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1290489969, now seen corresponding path program 1 times [2022-04-06 09:11:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:02,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011633628] [2022-04-06 09:11:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-06 09:11:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:11:02,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:02,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011633628] [2022-04-06 09:11:02,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011633628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:11:02,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:11:02,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 09:11:02,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003457875] [2022-04-06 09:11:02,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:11:02,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 09:11:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 09:11:02,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:11:02,972 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 09:11:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:03,092 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-04-06 09:11:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:11:03,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-06 09:11:03,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:03,094 INFO L225 Difference]: With dead ends: 59 [2022-04-06 09:11:03,095 INFO L226 Difference]: Without dead ends: 38 [2022-04-06 09:11:03,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-04-06 09:11:03,096 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:03,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 25 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:11:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-06 09:11:03,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-04-06 09:11:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-06 09:11:03,112 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2022-04-06 09:11:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:03,112 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-06 09:11:03,112 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 09:11:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-06 09:11:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 09:11:03,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:03,113 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:03,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 09:11:03,114 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:03,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 43929779, now seen corresponding path program 1 times [2022-04-06 09:11:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:03,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898374132] [2022-04-06 09:11:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-06 09:11:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:11:03,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:03,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898374132] [2022-04-06 09:11:03,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898374132] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:03,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956211502] [2022-04-06 09:11:03,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:03,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:03,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:03,204 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-04-06 09:11:03,209 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-04-06 09:11:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:03,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-06 09:11:03,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:11:03,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:11:03,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956211502] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:11:03,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:11:03,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-04-06 09:11:03,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911734557] [2022-04-06 09:11:03,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:03,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 09:11:03,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 09:11:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:11:03,413 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 09:11:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:03,578 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-04-06 09:11:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 09:11:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-04-06 09:11:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:03,580 INFO L225 Difference]: With dead ends: 68 [2022-04-06 09:11:03,581 INFO L226 Difference]: Without dead ends: 47 [2022-04-06 09:11:03,581 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-04-06 09:11:03,584 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 57 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:03,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 27 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:11:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-06 09:11:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2022-04-06 09:11:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-06 09:11:03,597 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2022-04-06 09:11:03,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:03,598 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-06 09:11:03,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 09:11:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-06 09:11:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-06 09:11:03,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:03,599 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:03,625 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-04-06 09:11:03,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:03,812 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash -969564551, now seen corresponding path program 2 times [2022-04-06 09:11:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:03,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463119439] [2022-04-06 09:11:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:03,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-06 09:11:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-06 09:11:03,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:03,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463119439] [2022-04-06 09:11:03,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463119439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:11:03,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:11:03,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:11:03,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042145887] [2022-04-06 09:11:03,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:11:03,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:11:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:03,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:11:03,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:11:03,922 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 09:11:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:04,055 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-04-06 09:11:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 09:11:04,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-06 09:11:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:04,056 INFO L225 Difference]: With dead ends: 55 [2022-04-06 09:11:04,056 INFO L226 Difference]: Without dead ends: 42 [2022-04-06 09:11:04,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-04-06 09:11:04,062 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:04,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 27 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:11:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-06 09:11:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-04-06 09:11:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-06 09:11:04,076 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2022-04-06 09:11:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:04,076 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-06 09:11:04,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 09:11:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-06 09:11:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-06 09:11:04,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:04,077 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:04,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 09:11:04,079 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1845213134, now seen corresponding path program 1 times [2022-04-06 09:11:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:04,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079746598] [2022-04-06 09:11:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:04,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:04,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-06 09:11:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-06 09:11:04,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:04,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079746598] [2022-04-06 09:11:04,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079746598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:04,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956599463] [2022-04-06 09:11:04,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:04,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:04,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:04,191 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-04-06 09:11:04,192 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-04-06 09:11:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:04,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-06 09:11:04,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 09:11:04,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 09:11:04,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956599463] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:11:04,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:11:04,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-04-06 09:11:04,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713046805] [2022-04-06 09:11:04,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:04,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-06 09:11:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-06 09:11:04,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-06 09:11:04,392 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-06 09:11:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:04,712 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-04-06 09:11:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-06 09:11:04,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2022-04-06 09:11:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:04,715 INFO L225 Difference]: With dead ends: 85 [2022-04-06 09:11:04,715 INFO L226 Difference]: Without dead ends: 63 [2022-04-06 09:11:04,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2022-04-06 09:11:04,716 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 106 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:04,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 34 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:11:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-06 09:11:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2022-04-06 09:11:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-06 09:11:04,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2022-04-06 09:11:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:04,728 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-06 09:11:04,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-06 09:11:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-06 09:11:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-06 09:11:04,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:04,728 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 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-04-06 09:11:04,755 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-04-06 09:11:04,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:04,939 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:04,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1453502491, now seen corresponding path program 1 times [2022-04-06 09:11:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:04,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142466043] [2022-04-06 09:11:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:04,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:05,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-06 09:11:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:05,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142466043] [2022-04-06 09:11:05,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142466043] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:05,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497323766] [2022-04-06 09:11:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:05,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:05,046 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-04-06 09:11:05,046 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-04-06 09:11:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:05,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 09:11:05,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-06 09:11:05,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-06 09:11:05,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497323766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:11:05,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:11:05,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2022-04-06 09:11:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435856316] [2022-04-06 09:11:05,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:05,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-06 09:11:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:05,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-06 09:11:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-06 09:11:05,317 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-06 09:11:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:05,725 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2022-04-06 09:11:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-06 09:11:05,726 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-04-06 09:11:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:05,726 INFO L225 Difference]: With dead ends: 83 [2022-04-06 09:11:05,726 INFO L226 Difference]: Without dead ends: 64 [2022-04-06 09:11:05,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2022-04-06 09:11:05,728 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:05,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 28 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:11:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-06 09:11:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2022-04-06 09:11:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-04-06 09:11:05,734 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 35 [2022-04-06 09:11:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:05,735 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-04-06 09:11:05,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-06 09:11:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-06 09:11:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-06 09:11:05,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:05,736 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:05,754 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-04-06 09:11:05,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:05,955 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:05,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash -444702843, now seen corresponding path program 2 times [2022-04-06 09:11:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:05,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252133899] [2022-04-06 09:11:05,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:05,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:06,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-06 09:11:06,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:06,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252133899] [2022-04-06 09:11:06,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252133899] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:06,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305241254] [2022-04-06 09:11:06,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 09:11:06,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:06,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:06,112 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-04-06 09:11:06,113 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-04-06 09:11:06,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 09:11:06,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:11:06,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 09:11:06,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-06 09:11:06,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-06 09:11:06,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305241254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:11:06,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:11:06,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 21 [2022-04-06 09:11:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708251314] [2022-04-06 09:11:06,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:06,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-06 09:11:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:06,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-06 09:11:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-04-06 09:11:06,587 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 09:11:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:06,952 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-04-06 09:11:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-06 09:11:06,952 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-04-06 09:11:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:06,953 INFO L225 Difference]: With dead ends: 88 [2022-04-06 09:11:06,953 INFO L226 Difference]: Without dead ends: 69 [2022-04-06 09:11:06,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2022-04-06 09:11:06,954 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:06,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 30 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:11:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-06 09:11:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2022-04-06 09:11:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:06,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-04-06 09:11:06,960 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 54 [2022-04-06 09:11:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:06,960 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-04-06 09:11:06,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 09:11:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-04-06 09:11:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-06 09:11:06,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:06,961 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:06,981 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-04-06 09:11:07,162 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:07,162 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:07,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:07,162 INFO L85 PathProgramCache]: Analyzing trace with hash -292182650, now seen corresponding path program 3 times [2022-04-06 09:11:07,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:07,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251159482] [2022-04-06 09:11:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:07,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:07,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:07,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-06 09:11:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:07,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251159482] [2022-04-06 09:11:07,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251159482] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:07,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428380023] [2022-04-06 09:11:07,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 09:11:07,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:07,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:07,233 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-04-06 09:11:07,234 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-04-06 09:11:07,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-04-06 09:11:07,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:11:07,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 09:11:07,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-06 09:11:07,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-06 09:11:07,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428380023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:11:07,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:11:07,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2022-04-06 09:11:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592389055] [2022-04-06 09:11:07,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:07,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-06 09:11:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-06 09:11:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-04-06 09:11:07,666 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-06 09:11:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:07,888 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2022-04-06 09:11:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-06 09:11:07,888 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2022-04-06 09:11:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:07,889 INFO L225 Difference]: With dead ends: 93 [2022-04-06 09:11:07,889 INFO L226 Difference]: Without dead ends: 80 [2022-04-06 09:11:07,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2022-04-06 09:11:07,890 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:07,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 30 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:11:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-06 09:11:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-06 09:11:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2022-04-06 09:11:07,897 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 57 [2022-04-06 09:11:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:07,897 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2022-04-06 09:11:07,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-06 09:11:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2022-04-06 09:11:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-06 09:11:07,898 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:07,898 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:07,917 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-04-06 09:11:08,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:08,112 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash -582619515, now seen corresponding path program 4 times [2022-04-06 09:11:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:08,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398806841] [2022-04-06 09:11:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:08,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-06 09:11:08,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:08,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398806841] [2022-04-06 09:11:08,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398806841] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:08,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347345007] [2022-04-06 09:11:08,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 09:11:08,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:08,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:08,219 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-04-06 09:11:08,220 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-04-06 09:11:08,281 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 09:11:08,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:11:08,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 09:11:08,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-06 09:11:08,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-04-06 09:11:08,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347345007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:11:08,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:11:08,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2022-04-06 09:11:08,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018041367] [2022-04-06 09:11:08,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:08,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-06 09:11:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:08,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-06 09:11:08,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-04-06 09:11:08,559 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-06 09:11:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:09,833 INFO L93 Difference]: Finished difference Result 203 states and 274 transitions. [2022-04-06 09:11:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-06 09:11:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2022-04-06 09:11:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:09,834 INFO L225 Difference]: With dead ends: 203 [2022-04-06 09:11:09,834 INFO L226 Difference]: Without dead ends: 175 [2022-04-06 09:11:09,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=971, Invalid=3061, Unknown=0, NotChecked=0, Total=4032 [2022-04-06 09:11:09,836 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 279 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:09,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 41 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 09:11:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-06 09:11:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 116. [2022-04-06 09:11:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 108 states have internal predecessors, (138), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2022-04-06 09:11:09,854 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 69 [2022-04-06 09:11:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:09,854 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2022-04-06 09:11:09,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-06 09:11:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-04-06 09:11:09,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-06 09:11:09,859 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:09,860 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:09,888 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-04-06 09:11:10,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:10,084 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash -551286544, now seen corresponding path program 5 times [2022-04-06 09:11:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:10,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673742713] [2022-04-06 09:11:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:10,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-06 09:11:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:10,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673742713] [2022-04-06 09:11:10,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673742713] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:10,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616614875] [2022-04-06 09:11:10,434 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-06 09:11:10,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:10,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:10,434 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-04-06 09:11:10,435 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-04-06 09:11:10,583 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-06 09:11:10,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:11:10,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-06 09:11:10,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:10,630 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-06 09:11:10,631 INFO L390 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 11 treesize of output 11 [2022-04-06 09:11:10,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-06 09:11:11,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-04-06 09:11:11,257 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-04-06 09:11:11,257 INFO L390 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 1 case distinctions, treesize of input 19 treesize of output 10 [2022-04-06 09:11:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-06 09:11:11,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:11,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_320 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_320) |c_main_~#array~1.base|) |c_main_~#array~1.offset|) 0)) is different from false [2022-04-06 09:11:11,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616614875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:11,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 09:11:11,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2022-04-06 09:11:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260343369] [2022-04-06 09:11:11,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:11,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-06 09:11:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-06 09:11:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=961, Unknown=9, NotChecked=62, Total=1122 [2022-04-06 09:11:11,412 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 24 states have internal predecessors, (68), 5 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:12,191 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-04-06 09:11:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-06 09:11:12,192 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 24 states have internal predecessors, (68), 5 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 78 [2022-04-06 09:11:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:12,193 INFO L225 Difference]: With dead ends: 126 [2022-04-06 09:11:12,193 INFO L226 Difference]: Without dead ends: 124 [2022-04-06 09:11:12,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=255, Invalid=2387, Unknown=14, NotChecked=100, Total=2756 [2022-04-06 09:11:12,194 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 89 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:12,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 213 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 759 Invalid, 0 Unknown, 52 Unchecked, 0.3s Time] [2022-04-06 09:11:12,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-06 09:11:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2022-04-06 09:11:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 113 states have internal predecessors, (142), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 09:11:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2022-04-06 09:11:12,206 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 78 [2022-04-06 09:11:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:12,207 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2022-04-06 09:11:12,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 24 states have internal predecessors, (68), 5 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 09:11:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2022-04-06 09:11:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-06 09:11:12,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:12,208 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:12,227 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-04-06 09:11:12,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:12,425 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:12,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash 215004892, now seen corresponding path program 1 times [2022-04-06 09:11:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:12,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934860626] [2022-04-06 09:11:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:12,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-06 09:11:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 2 proven. 138 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-04-06 09:11:12,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:12,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934860626] [2022-04-06 09:11:12,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934860626] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:12,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385393324] [2022-04-06 09:11:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:12,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:12,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:12,846 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:11:12,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-06 09:11:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:12,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-06 09:11:12,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:12,969 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-06 09:11:12,970 INFO L390 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 11 treesize of output 11 [2022-04-06 09:11:13,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-06 09:11:13,142 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-06 09:11:13,143 INFO L390 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 25 treesize of output 24 [2022-04-06 09:11:13,535 INFO L390 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 16 treesize of output 18 [2022-04-06 09:11:13,745 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-06 09:11:13,746 INFO L390 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 1 case distinctions, treesize of input 21 treesize of output 10 [2022-04-06 09:11:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-06 09:11:13,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:13,937 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_405) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 4)) 1)) is different from false [2022-04-06 09:11:13,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385393324] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:13,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 09:11:13,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2022-04-06 09:11:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484630881] [2022-04-06 09:11:13,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:13,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-06 09:11:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:13,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-06 09:11:13,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1421, Unknown=11, NotChecked=76, Total=1640 [2022-04-06 09:11:13,939 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 31 states have internal predecessors, (82), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-06 09:11:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:15,049 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2022-04-06 09:11:15,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-06 09:11:15,049 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 31 states have internal predecessors, (82), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 86 [2022-04-06 09:11:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:15,050 INFO L225 Difference]: With dead ends: 134 [2022-04-06 09:11:15,050 INFO L226 Difference]: Without dead ends: 132 [2022-04-06 09:11:15,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 83 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=379, Invalid=3515, Unknown=16, NotChecked=122, Total=4032 [2022-04-06 09:11:15,052 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 98 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:15,052 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 216 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 738 Invalid, 0 Unknown, 149 Unchecked, 0.4s Time] [2022-04-06 09:11:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-06 09:11:15,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-04-06 09:11:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 119 states have internal predecessors, (148), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-06 09:11:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-04-06 09:11:15,064 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 86 [2022-04-06 09:11:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:15,064 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-04-06 09:11:15,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 31 states have internal predecessors, (82), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-06 09:11:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-04-06 09:11:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-06 09:11:15,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:15,065 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:15,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-06 09:11:15,285 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-06 09:11:15,285 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1130972984, now seen corresponding path program 2 times [2022-04-06 09:11:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:15,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320527013] [2022-04-06 09:11:15,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:15,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:15,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-06 09:11:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-06 09:11:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-04-06 09:11:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:15,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320527013] [2022-04-06 09:11:15,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320527013] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:15,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157219827] [2022-04-06 09:11:15,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 09:11:15,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:15,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:15,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:11:15,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-06 09:11:15,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 09:11:15,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:11:15,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-06 09:11:15,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:15,978 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-06 09:11:15,978 INFO L390 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 11 treesize of output 11 [2022-04-06 09:11:16,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-06 09:11:16,124 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-06 09:11:16,124 INFO L390 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 25 treesize of output 24 [2022-04-06 09:11:16,168 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-06 09:11:16,169 INFO L390 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 25 treesize of output 24 [2022-04-06 09:11:16,521 INFO L390 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 16 treesize of output 18 [2022-04-06 09:11:16,789 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-06 09:11:16,789 INFO L390 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 1 case distinctions, treesize of input 21 treesize of output 10 [2022-04-06 09:11:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 1 proven. 143 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-04-06 09:11:16,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:17,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_492) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 8)))) is different from false [2022-04-06 09:11:17,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157219827] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:17,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 09:11:17,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2022-04-06 09:11:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059527877] [2022-04-06 09:11:17,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:17,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-06 09:11:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-06 09:11:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1648, Unknown=11, NotChecked=82, Total=1892 [2022-04-06 09:11:17,016 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 33 states have internal predecessors, (88), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-06 09:11:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:18,169 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2022-04-06 09:11:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-06 09:11:18,170 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 33 states have internal predecessors, (88), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 94 [2022-04-06 09:11:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:18,171 INFO L225 Difference]: With dead ends: 142 [2022-04-06 09:11:18,171 INFO L226 Difference]: Without dead ends: 140 [2022-04-06 09:11:18,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=431, Invalid=4113, Unknown=16, NotChecked=132, Total=4692 [2022-04-06 09:11:18,172 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 133 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:18,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 264 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 869 Invalid, 0 Unknown, 130 Unchecked, 0.4s Time] [2022-04-06 09:11:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-06 09:11:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-04-06 09:11:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.2419354838709677) internal successors, (154), 125 states have internal predecessors, (154), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-06 09:11:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2022-04-06 09:11:18,185 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 94 [2022-04-06 09:11:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:18,185 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2022-04-06 09:11:18,185 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 33 states have internal predecessors, (88), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-06 09:11:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2022-04-06 09:11:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-06 09:11:18,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:18,186 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:18,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-06 09:11:18,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:18,400 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash 971116212, now seen corresponding path program 3 times [2022-04-06 09:11:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:18,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331556150] [2022-04-06 09:11:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:18,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:18,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:18,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:18,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-06 09:11:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-06 09:11:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-06 09:11:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 6 proven. 150 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-04-06 09:11:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:18,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331556150] [2022-04-06 09:11:18,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331556150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:18,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487201602] [2022-04-06 09:11:18,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 09:11:18,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:18,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:18,947 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:11:18,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-06 09:11:19,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-04-06 09:11:19,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:11:19,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-06 09:11:19,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:19,214 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-04-06 09:11:19,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-04-06 09:11:19,277 INFO L390 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 15 treesize of output 11 [2022-04-06 09:11:19,358 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-04-06 09:11:19,359 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-04-06 09:11:19,408 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-04-06 09:11:19,408 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-04-06 09:11:19,523 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-04-06 09:11:19,523 INFO L390 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 1 case distinctions, treesize of input 29 treesize of output 34 [2022-04-06 09:11:19,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-06 09:11:19,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-04-06 09:11:20,552 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-04-06 09:11:20,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-04-06 09:11:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-04-06 09:11:20,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:20,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_581 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_581) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 12)))) is different from false [2022-04-06 09:11:20,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487201602] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:20,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 09:11:20,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-04-06 09:11:20,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373627710] [2022-04-06 09:11:20,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:20,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-06 09:11:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:20,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-06 09:11:20,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1884, Unknown=12, NotChecked=88, Total=2162 [2022-04-06 09:11:20,812 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 40 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 35 states have internal predecessors, (93), 12 states have call successors, (14), 9 states have call predecessors, (14), 6 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-06 09:11:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:22,245 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2022-04-06 09:11:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-06 09:11:22,245 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 35 states have internal predecessors, (93), 12 states have call successors, (14), 9 states have call predecessors, (14), 6 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 102 [2022-04-06 09:11:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:22,246 INFO L225 Difference]: With dead ends: 151 [2022-04-06 09:11:22,246 INFO L226 Difference]: Without dead ends: 149 [2022-04-06 09:11:22,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 113 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=511, Invalid=4588, Unknown=17, NotChecked=140, Total=5256 [2022-04-06 09:11:22,248 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:22,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 253 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 763 Invalid, 0 Unknown, 146 Unchecked, 0.4s Time] [2022-04-06 09:11:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-06 09:11:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2022-04-06 09:11:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 131 states have internal predecessors, (160), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-06 09:11:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2022-04-06 09:11:22,263 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 102 [2022-04-06 09:11:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:22,263 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2022-04-06 09:11:22,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 35 states have internal predecessors, (93), 12 states have call successors, (14), 9 states have call predecessors, (14), 6 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-06 09:11:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2022-04-06 09:11:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-06 09:11:22,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:22,264 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:22,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-06 09:11:22,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-06 09:11:22,471 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:22,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1541490528, now seen corresponding path program 4 times [2022-04-06 09:11:22,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:22,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447542051] [2022-04-06 09:11:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:22,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:23,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:23,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-06 09:11:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-06 09:11:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:23,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-06 09:11:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-06 09:11:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 8 proven. 168 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-04-06 09:11:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:23,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447542051] [2022-04-06 09:11:23,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447542051] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:23,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987502606] [2022-04-06 09:11:23,129 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 09:11:23,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:23,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:23,131 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:11:23,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-06 09:11:23,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 09:11:23,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:11:23,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-06 09:11:23,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:23,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-06 09:11:23,291 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-04-06 09:11:23,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-04-06 09:11:23,333 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-04-06 09:11:23,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-04-06 09:11:23,365 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-04-06 09:11:23,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-04-06 09:11:23,398 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-04-06 09:11:23,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-04-06 09:11:25,195 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-04-06 09:11:25,195 INFO L390 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 26 treesize of output 12 [2022-04-06 09:11:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 5 proven. 271 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-06 09:11:25,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:11:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 13 proven. 52 refuted. 102 times theorem prover too weak. 152 trivial. 0 not checked. [2022-04-06 09:11:30,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987502606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:11:30,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:11:30,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33, 21] total 65 [2022-04-06 09:11:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782978370] [2022-04-06 09:11:30,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:11:30,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-06 09:11:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:30,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-06 09:11:30,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=3707, Unknown=3, NotChecked=0, Total=4160 [2022-04-06 09:11:30,741 INFO L87 Difference]: Start difference. First operand 146 states and 175 transitions. Second operand has 65 states, 63 states have (on average 2.6825396825396823) internal successors, (169), 61 states have internal predecessors, (169), 19 states have call successors, (22), 8 states have call predecessors, (22), 6 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-06 09:11:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:46,763 INFO L93 Difference]: Finished difference Result 459 states and 600 transitions. [2022-04-06 09:11:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-06 09:11:46,763 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 2.6825396825396823) internal successors, (169), 61 states have internal predecessors, (169), 19 states have call successors, (22), 8 states have call predecessors, (22), 6 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) Word has length 110 [2022-04-06 09:11:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:46,766 INFO L225 Difference]: With dead ends: 459 [2022-04-06 09:11:46,766 INFO L226 Difference]: Without dead ends: 457 [2022-04-06 09:11:46,769 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 184 SyntacticMatches, 28 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4948 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=1329, Invalid=11317, Unknown=10, NotChecked=0, Total=12656 [2022-04-06 09:11:46,769 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 201 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 730 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:46,769 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 193 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2161 Invalid, 0 Unknown, 730 Unchecked, 0.8s Time] [2022-04-06 09:11:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-04-06 09:11:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 154. [2022-04-06 09:11:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.2205882352941178) internal successors, (166), 137 states have internal predecessors, (166), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-06 09:11:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2022-04-06 09:11:46,790 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 183 transitions. Word has length 110 [2022-04-06 09:11:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:46,791 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 183 transitions. [2022-04-06 09:11:46,791 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 2.6825396825396823) internal successors, (169), 61 states have internal predecessors, (169), 19 states have call successors, (22), 8 states have call predecessors, (22), 6 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-06 09:11:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 183 transitions. [2022-04-06 09:11:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-06 09:11:46,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:11:46,792 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:11:46,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-06 09:11:46,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-06 09:11:46,997 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 09:11:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:11:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash -289884532, now seen corresponding path program 5 times [2022-04-06 09:11:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:11:46,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353496324] [2022-04-06 09:11:46,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:11:46,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:11:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:11:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:47,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 09:11:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-06 09:11:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:47,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-06 09:11:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-06 09:11:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:47,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-06 09:11:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-06 09:11:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:11:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-04-06 09:11:47,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:11:47,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353496324] [2022-04-06 09:11:47,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353496324] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:11:47,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637980342] [2022-04-06 09:11:47,092 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-06 09:11:47,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:11:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:11:47,092 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:11:47,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-06 09:11:47,277 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-04-06 09:11:47,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 09:11:47,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 09:11:47,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:11:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-04-06 09:11:47,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 09:11:47,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637980342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:11:47,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 09:11:47,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11 [2022-04-06 09:11:47,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535260477] [2022-04-06 09:11:47,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:11:47,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 09:11:47,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:11:47,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 09:11:47,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:11:47,436 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-06 09:11:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:11:47,508 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2022-04-06 09:11:47,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:11:47,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 118 [2022-04-06 09:11:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:11:47,509 INFO L225 Difference]: With dead ends: 157 [2022-04-06 09:11:47,509 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 09:11:47,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:11:47,513 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:11:47,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 155 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:11:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 09:11:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 09:11:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-04-06 09:11:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 09:11:47,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-04-06 09:11:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:11:47,514 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 09:11:47,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-06 09:11:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 09:11:47,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 09:11:47,516 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 09:11:47,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-06 09:11:47,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-06 09:11:47,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 09:12:00,570 WARN L232 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 291 DAG size of output: 281 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-06 09:13:54,144 WARN L232 SmtUtils]: Spent 1.88m on a formula simplification. DAG size of input: 272 DAG size of output: 39 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 09:13:54,652 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~n~0 |old(~n~0)|) (= |~#array~0.offset| |old(~#array~0.offset)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 09:13:54,652 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 09:13:54,653 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 |~#array~0.offset|) (= 3 |~#array~0.base|) (= (select |#valid| 3) 1) (<= 5 ~n~0) (= (select |#valid| 2) 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-04-06 09:13:54,653 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L878 garLoopResultBuilder]: At program point SelectionSortENTRY(lines 26 38) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select |#valid| 2) 1)) (not (<= 0 |~#array~0.offset|))) [2022-04-06 09:13:54,653 INFO L878 garLoopResultBuilder]: At program point L30-3(lines 30 37) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= SelectionSort_~lh~0 0)) (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) (and (<= SelectionSort_~lh~0 SelectionSort_~i~0) (exists ((v_ArrVal_570 (Array Int Int))) (= (store |old(#memory_int)| |~#array~0.base| v_ArrVal_570) |#memory_int|))) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select |#valid| 2) 1)) (not (<= 0 |~#array~0.offset|))) [2022-04-06 09:13:54,653 INFO L882 garLoopResultBuilder]: For program point L30-4(lines 26 38) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L878 garLoopResultBuilder]: At program point L32-3(lines 32 33) the Hoare annotation is: (or (and (<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0) (< SelectionSort_~lh~0 ~n~0) (exists ((v_ArrVal_570 (Array Int Int))) (= (store |old(#memory_int)| |~#array~0.base| v_ArrVal_570) |#memory_int|))) (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select |#valid| 2) 1)) (not (<= 0 |~#array~0.offset|))) [2022-04-06 09:13:54,653 INFO L882 garLoopResultBuilder]: For program point SelectionSortEXIT(lines 26 38) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L882 garLoopResultBuilder]: For program point L32-4(lines 32 33) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L882 garLoopResultBuilder]: For program point L30-2(lines 30 37) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L882 garLoopResultBuilder]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2022-04-06 09:13:54,653 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 40 52) the Hoare annotation is: (or (not (= (select |old(#valid)| 2) 1)) (and (= |#memory_int| |old(#memory_int)|) (= (select |#valid| 3) 1) (= (select |#valid| 2) 1)) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (<= 0 |~#array~0.offset|))) [2022-04-06 09:13:54,653 INFO L878 garLoopResultBuilder]: At program point L44-3(lines 44 45) the Hoare annotation is: (let ((.cse15 (+ 16 |~#array~0.offset|)) (.cse13 (+ |~#array~0.offset| 4)) (.cse10 (* main_~i~1 4)) (.cse9 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse11 (= 2 (select .cse9 (+ 8 |main_~#array~1.offset|)))) (.cse12 (= (select .cse9 (+ 4 |main_~#array~1.offset|)) 1)) (.cse6 (= (select .cse9 12) 3)) (.cse14 (= (select .cse9 (+ .cse10 8)) (+ main_~i~1 2))) (.cse8 (= |main_~#array~1.offset| 0)) (.cse0 (= (select .cse9 .cse15) .cse13)) (.cse1 (= (select |#valid| 3) 1)) (.cse2 (< 1 |main_~#array~1.base|)) (.cse3 (not (= |main_~#array~1.base| 3))) (.cse7 (+ .cse10 |main_~#array~1.offset|)) (.cse4 (= (select |#valid| 2) 1)) (.cse5 (not (= |main_~#array~1.base| 2)))) (or (not (= (select |old(#valid)| 2) 1)) (and .cse0 .cse1 .cse2 .cse3 (= main_~i~1 2) .cse4 .cse5 .cse6 (= (+ |~#array~0.offset| 8) .cse7)) (and .cse8 (= (select .cse9 |main_~#array~1.offset|) 0) (exists ((v_main_~i~1_86 Int)) (and (<= 0 v_main_~i~1_86) (= (select (select |#memory_int| |main_~#array~1.base|) (+ 16 (* v_main_~i~1_86 4) |main_~#array~1.offset|)) (+ v_main_~i~1_86 4)) (<= v_main_~i~1_86 (+ main_~i~1 1)))) (= (select .cse9 (+ 16 .cse10 |main_~#array~1.offset|)) (+ main_~i~1 4)) .cse1 .cse2 .cse3 (<= main_~i~1 0) .cse4 .cse11 .cse5 .cse12 .cse6) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#valid)| 3) 1)) (and (= .cse13 .cse7) .cse0 .cse1 .cse2 .cse3 (= main_~i~1 1) .cse4 .cse11 .cse5 .cse14) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 (= main_~i~1 0) .cse14) (and .cse8 (= |#memory_int| |old(#memory_int)|) .cse1 .cse2 .cse3 (<= .cse15 .cse10) .cse4 .cse5 (<= main_~i~1 4)) (and (= main_~i~1 3) .cse0 .cse1 .cse2 .cse3 (= 12 .cse7) .cse4 .cse5) (not (<= 0 |~#array~0.offset|))))) [2022-04-06 09:13:54,654 INFO L878 garLoopResultBuilder]: At program point L44-4(lines 44 45) the Hoare annotation is: (or (not (= (select |old(#valid)| 2) 1)) (let ((.cse0 (select |#memory_int| |main_~#array~1.base|))) (and (= |main_~#array~1.offset| 0) (= (select .cse0 |main_~#array~1.offset|) 0) (= (select .cse0 (+ 16 |~#array~0.offset|)) (+ |~#array~0.offset| 4)) (= (select |#valid| 3) 1) (< 1 |main_~#array~1.base|) (not (= |main_~#array~1.base| 3)) (<= main_~i~1 0) (= (select |#valid| 2) 1) (= 2 (select .cse0 (+ 8 |main_~#array~1.offset|))) (not (= |main_~#array~1.base| 2)) (= (select .cse0 (+ 4 |main_~#array~1.offset|)) 1) (= (select .cse0 12) 3))) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (<= 0 |~#array~0.offset|))) [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L878 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: (let ((.cse10 (* main_~i~1 4)) (.cse9 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse2 (= (select .cse9 8) 2)) (.cse1 (= (select .cse9 |main_~#array~1.offset|) 0)) (.cse0 (= |main_~#array~1.offset| 0)) (.cse3 (< 1 |main_~#array~1.base|)) (.cse4 (not (= |main_~#array~1.base| 3))) (.cse11 (= 2 (select .cse9 (+ 8 |main_~#array~1.offset|)))) (.cse5 (not (= |main_~#array~1.base| 2))) (.cse6 (= main_~i~1 (select .cse9 (+ .cse10 |main_~#array~1.offset|)))) (.cse7 (= (select .cse9 (+ 4 |main_~#array~1.offset|)) 1)) (.cse8 (= (select .cse9 12) 3))) (or (not (= (select |old(#valid)| 2) 1)) (and .cse0 .cse1 .cse2 (= main_~i~1 4) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (<= 5 main_~i~1) .cse4 .cse5 .cse7 .cse8) (and .cse0 (= (select .cse9 (+ .cse10 4)) (+ main_~i~1 1)) .cse1 .cse2 (= main_~i~1 3) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 (= main_~i~1 2) .cse5 .cse6 .cse7 .cse8 (= (select .cse9 (+ .cse10 8)) (+ main_~i~1 2))) (and .cse0 .cse1 .cse3 (= (select .cse9 (+ .cse10 12)) (+ main_~i~1 3)) .cse4 (= main_~i~1 1) .cse11 .cse5 .cse7 .cse8) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse0 .cse3 (= (select .cse9 16) 4) .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 (= main_~i~1 0)) (not (<= 0 |~#array~0.offset|))))) [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point L49-4(lines 49 50) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse11 (* main_~i~1 4)) (.cse2 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse5 (= 2 (select .cse2 (+ 8 |main_~#array~1.offset|)))) (.cse12 (= (select .cse2 8) 2)) (.cse0 (= |main_~#array~1.offset| 0)) (.cse10 (= (select .cse2 |main_~#array~1.offset|) 0)) (.cse1 (< 1 |main_~#array~1.base|)) (.cse3 (= main_~i~1 |main_#t~mem9|)) (.cse4 (not (= |main_~#array~1.base| 3))) (.cse6 (not (= |main_~#array~1.base| 2))) (.cse7 (= main_~i~1 (select .cse2 (+ .cse11 |main_~#array~1.offset|)))) (.cse8 (= (select .cse2 (+ 4 |main_~#array~1.offset|)) 1)) (.cse9 (= (select .cse2 12) 3))) (or (not (= (select |old(#valid)| 2) 1)) (and .cse0 .cse1 (= (select .cse2 16) 4) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= main_~i~1 0)) (not (< 0 |#StackHeapBarrier|)) (and .cse0 .cse10 .cse1 .cse3 (= (select .cse2 (+ .cse11 12)) (+ main_~i~1 3)) .cse4 (= main_~i~1 1) .cse5 .cse6 .cse8 .cse9) (not (= (select |old(#valid)| 3) 1)) (and .cse0 .cse10 (< |main_#t~mem9| 5) .cse12 (= main_~i~1 4) .cse1 .cse4 (<= 4 |main_#t~mem9|) .cse6 .cse7 .cse8 .cse9) (and .cse0 (= (select .cse2 (+ .cse11 4)) (+ main_~i~1 1)) .cse10 .cse12 (= main_~i~1 3) .cse1 .cse3 .cse4 .cse6 .cse7 .cse8) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse0 .cse10 .cse1 .cse3 .cse4 (= main_~i~1 2) .cse6 .cse7 .cse8 .cse9 (= (select .cse2 (+ .cse11 8)) (+ main_~i~1 2))) (not (<= 0 |~#array~0.offset|))))) [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 40 52) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 40 52) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-06 09:13:54,654 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-04-06 09:13:54,656 INFO L719 BasicCegarLoop]: Path program histogram: [5, 5, 2, 1, 1, 1] [2022-04-06 09:13:54,657 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 09:13:54,662 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-04-06 09:13:54,667 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-04-06 09:13:54,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,669 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,671 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,672 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-04-06 09:13:54,674 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-04-06 09:13:54,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:13:54 BasicIcfg [2022-04-06 09:13:54,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 09:13:54,678 INFO L158 Benchmark]: Toolchain (without parser) took 172714.98ms. Allocated memory was 185.6MB in the beginning and 411.0MB in the end (delta: 225.4MB). Free memory was 126.2MB in the beginning and 137.2MB in the end (delta: -10.9MB). Peak memory consumption was 219.7MB. Max. memory is 8.0GB. [2022-04-06 09:13:54,678 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 09:13:54,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.73ms. Allocated memory was 185.6MB in the beginning and 284.2MB in the end (delta: 98.6MB). Free memory was 126.0MB in the beginning and 254.3MB in the end (delta: -128.3MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-04-06 09:13:54,679 INFO L158 Benchmark]: Boogie Preprocessor took 23.67ms. Allocated memory is still 284.2MB. Free memory was 254.3MB in the beginning and 252.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 09:13:54,679 INFO L158 Benchmark]: RCFGBuilder took 247.28ms. Allocated memory is still 284.2MB. Free memory was 252.7MB in the beginning and 240.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-06 09:13:54,679 INFO L158 Benchmark]: IcfgTransformer took 20.55ms. Allocated memory is still 284.2MB. Free memory was 240.7MB in the beginning and 239.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 09:13:54,679 INFO L158 Benchmark]: TraceAbstraction took 172227.35ms. Allocated memory was 284.2MB in the beginning and 411.0MB in the end (delta: 126.9MB). Free memory was 238.6MB in the beginning and 137.2MB in the end (delta: 101.4MB). Peak memory consumption was 233.0MB. Max. memory is 8.0GB. [2022-04-06 09:13:54,680 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.73ms. Allocated memory was 185.6MB in the beginning and 284.2MB in the end (delta: 98.6MB). Free memory was 126.0MB in the beginning and 254.3MB in the end (delta: -128.3MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.67ms. Allocated memory is still 284.2MB. Free memory was 254.3MB in the beginning and 252.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 247.28ms. Allocated memory is still 284.2MB. Free memory was 252.7MB in the beginning and 240.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 20.55ms. Allocated memory is still 284.2MB. Free memory was 240.7MB in the beginning and 239.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 172227.35ms. Allocated memory was 284.2MB in the beginning and 411.0MB in the end (delta: 126.9MB). Free memory was 238.6MB in the beginning and 137.2MB in the end (delta: 101.4MB). Peak memory consumption was 233.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 172.2s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 126.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1743 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1734 mSDsluCounter, 1566 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1207 IncrementalHoareTripleChecker+Unchecked, 1166 mSDsCounter, 933 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7214 IncrementalHoareTripleChecker+Invalid, 9354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 933 mSolverCounterUnsat, 400 mSDtfsCounter, 7214 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1840 GetRequests, 1195 SyntacticMatches, 69 SemanticMatches, 576 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 10265 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=14, InterpolantAutomatonStates: 313, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 444 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 38 PreInvPairs, 89 NumberOfFragments, 1488 HoareAnnotationTreeSize, 38 FomulaSimplifications, 274091 FormulaSimplificationTreeSizeReduction, 12.9s HoareSimplificationTime, 12 FomulaSimplificationsInter, 49656 FormulaSimplificationTreeSizeReductionInter, 114.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 1768 NumberOfCodeBlocks, 1761 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2109 ConstructedInterpolants, 274 QuantifiedInterpolants, 17170 SizeOfPredicates, 64 NumberOfNonLiveVariables, 3096 ConjunctsInSsa, 317 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 2788/5062 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2022-04-06 09:13:54,689 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-04-06 09:13:54,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] Derived loop invariant: ((((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && lh == 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || (lh <= i && (\exists v_ArrVal_570 : [int]int :: \old(unknown-#memory_int-unknown)[array := v_ArrVal_570] == unknown-#memory_int-unknown))) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || !(\valid[2] == 1)) || !(0 <= array) - InvariantResult [Line: 44]: Loop Invariant [2022-04-06 09:13:54,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,690 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,697 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,698 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-04-06 09:13:54,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] Derived loop invariant: (((((((((((!(\old(\valid)[2] == 1) || ((((((((unknown-#memory_int-unknown[array][16 + array] == array + 4 && \valid[3] == 1) && 1 < array) && !(array == 3)) && i == 2) && \valid[2] == 1) && !(array == 2)) && unknown-#memory_int-unknown[array][12] == 3) && array + 8 == i * 4 + array)) || ((((((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists v_main_~i~1_86 : int :: (0 <= v_main_~i~1_86 && unknown-#memory_int-unknown[array][16 + v_main_~i~1_86 * 4 + array] == v_main_~i~1_86 + 4) && v_main_~i~1_86 <= i + 1)) && unknown-#memory_int-unknown[array][16 + i * 4 + array] == i + 4) && \valid[3] == 1) && 1 < array) && !(array == 3)) && i <= 0) && \valid[2] == 1) && 2 == unknown-#memory_int-unknown[array][8 + array]) && !(array == 2)) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\old(\valid)[3] == 1)) || (((((((((array + 4 == i * 4 + array && unknown-#memory_int-unknown[array][16 + array] == array + 4) && \valid[3] == 1) && 1 < array) && !(array == 3)) && i == 1) && \valid[2] == 1) && 2 == unknown-#memory_int-unknown[array][8 + array]) && !(array == 2)) && unknown-#memory_int-unknown[array][i * 4 + 8] == i + 2)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || ((((((((((array == 0 && unknown-#memory_int-unknown[array][16 + array] == array + 4) && \valid[3] == 1) && 1 < array) && !(array == 3)) && \valid[2] == 1) && !(array == 2)) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3) && i == 0) && unknown-#memory_int-unknown[array][i * 4 + 8] == i + 2)) || ((((((((array == 0 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \valid[3] == 1) && 1 < array) && !(array == 3)) && 16 + array <= i * 4) && \valid[2] == 1) && !(array == 2)) && i <= 4)) || (((((((i == 3 && unknown-#memory_int-unknown[array][16 + array] == array + 4) && \valid[3] == 1) && 1 < array) && !(array == 3)) && 12 == i * 4 + array) && \valid[2] == 1) && !(array == 2))) || !(0 <= array) - InvariantResult [Line: 32]: Loop Invariant [2022-04-06 09:13:54,699 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-04-06 09:13:54,700 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] Derived loop invariant: ((((((((lh + 1 <= i && lh < n) && (\exists v_ArrVal_570 : [int]int :: \old(unknown-#memory_int-unknown)[array := v_ArrVal_570] == unknown-#memory_int-unknown)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || !(\valid[2] == 1)) || !(0 <= array) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((!(\old(\valid)[2] == 1) || (((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][8] == 2) && i == 4) && 1 < array) && !(array == 3)) && !(array == 2)) && i == unknown-#memory_int-unknown[array][i * 4 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3)) || ((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][8] == 2) && 1 < array) && 5 <= i) && !(array == 3)) && !(array == 2)) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3)) || (((((((((array == 0 && unknown-#memory_int-unknown[array][i * 4 + 4] == i + 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][8] == 2) && i == 3) && 1 < array) && !(array == 3)) && !(array == 2)) && i == unknown-#memory_int-unknown[array][i * 4 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1)) || (((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && !(array == 3)) && i == 2) && !(array == 2)) && i == unknown-#memory_int-unknown[array][i * 4 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3) && unknown-#memory_int-unknown[array][i * 4 + 8] == i + 2)) || (((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && unknown-#memory_int-unknown[array][i * 4 + 12] == i + 3) && !(array == 3)) && i == 1) && 2 == unknown-#memory_int-unknown[array][8 + array]) && !(array == 2)) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\old(\valid)[3] == 1)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || (((((((((array == 0 && 1 < array) && unknown-#memory_int-unknown[array][16] == 4) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array]) && !(array == 2)) && i == unknown-#memory_int-unknown[array][i * 4 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3) && i == 0)) || !(0 <= array) RESULT: Ultimate proved your program to be correct! [2022-04-06 09:13:54,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...