/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/duplets.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 12:20:28,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 12:20:28,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 12:20:28,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 12:20:28,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 12:20:28,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 12:20:28,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 12:20:28,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 12:20:28,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 12:20:28,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 12:20:28,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 12:20:28,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 12:20:28,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 12:20:28,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 12:20:28,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 12:20:28,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 12:20:28,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 12:20:28,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 12:20:28,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 12:20:28,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 12:20:28,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 12:20:28,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 12:20:28,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 12:20:28,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 12:20:28,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 12:20:28,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 12:20:28,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 12:20:28,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 12:20:28,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 12:20:28,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 12:20:28,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 12:20:28,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 12:20:28,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 12:20:28,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 12:20:28,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 12:20:28,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 12:20:28,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 12:20:28,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 12:20:28,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 12:20:28,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 12:20:28,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 12:20:28,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 12:20:28,360 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 12:20:28,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 12:20:28,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 12:20:28,363 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 12:20:28,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 12:20:28,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 12:20:28,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 12:20:28,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 12:20:28,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 12:20:28,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 12:20:28,364 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 12:20:28,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 12:20:28,364 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 12:20:28,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 12:20:28,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 12:20:28,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 12:20:28,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 12:20:28,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 12:20:28,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 12:20:28,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 12:20:28,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 12:20:28,365 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 12:20:28,365 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 12:20:28,365 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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; [2021-05-06 12:20:28,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 12:20:28,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 12:20:28,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 12:20:28,597 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 12:20:28,598 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 12:20:28,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2021-05-06 12:20:28,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4424a8ca/fc26fcd2808a4a2982ea52b9a366172f/FLAG27d58a5b8 [2021-05-06 12:20:29,064 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 12:20:29,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2021-05-06 12:20:29,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4424a8ca/fc26fcd2808a4a2982ea52b9a366172f/FLAG27d58a5b8 [2021-05-06 12:20:29,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4424a8ca/fc26fcd2808a4a2982ea52b9a366172f [2021-05-06 12:20:29,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 12:20:29,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 12:20:29,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 12:20:29,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 12:20:29,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 12:20:29,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:20:29" (1/1) ... [2021-05-06 12:20:29,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa9113c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29, skipping insertion in model container [2021-05-06 12:20:29,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 12:20:29" (1/1) ... [2021-05-06 12:20:29,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 12:20:29,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 12:20:29,212 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2021-05-06 12:20:29,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 12:20:29,310 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 12:20:29,317 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2021-05-06 12:20:29,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 12:20:29,346 INFO L208 MainTranslator]: Completed translation [2021-05-06 12:20:29,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29 WrapperNode [2021-05-06 12:20:29,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 12:20:29,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 12:20:29,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 12:20:29,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 12:20:29,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29" (1/1) ... [2021-05-06 12:20:29,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29" (1/1) ... [2021-05-06 12:20:29,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29" (1/1) ... [2021-05-06 12:20:29,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29" (1/1) ... [2021-05-06 12:20:29,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29" (1/1) ... [2021-05-06 12:20:29,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29" (1/1) ... [2021-05-06 12:20:29,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29" (1/1) ... [2021-05-06 12:20:29,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 12:20:29,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 12:20:29,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 12:20:29,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 12:20:29,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 12:20:29,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 12:20:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 12:20:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 12:20:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 12:20:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 12:20:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2021-05-06 12:20:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2021-05-06 12:20:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 12:20:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-05-06 12:20:29,451 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-05-06 12:20:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-05-06 12:20:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 12:20:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 12:20:29,452 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 12:20:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 12:20:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 12:20:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 12:20:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 12:20:29,453 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2021-05-06 12:20:29,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 12:20:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2021-05-06 12:20:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 12:20:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 12:20:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-06 12:20:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-05-06 12:20:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 12:20:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 12:20:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 12:20:29,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 12:20:29,744 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 12:20:29,744 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-06 12:20:29,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:20:29 BoogieIcfgContainer [2021-05-06 12:20:29,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 12:20:29,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 12:20:29,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 12:20:29,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 12:20:29,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 12:20:29" (1/3) ... [2021-05-06 12:20:29,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd39aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:20:29, skipping insertion in model container [2021-05-06 12:20:29,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 12:20:29" (2/3) ... [2021-05-06 12:20:29,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd39aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 12:20:29, skipping insertion in model container [2021-05-06 12:20:29,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 12:20:29" (3/3) ... [2021-05-06 12:20:29,749 INFO L111 eAbstractionObserver]: Analyzing ICFG duplets.c [2021-05-06 12:20:29,752 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 12:20:29,755 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 12:20:29,764 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 12:20:29,776 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 12:20:29,776 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 12:20:29,776 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 12:20:29,776 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 12:20:29,776 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 12:20:29,777 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 12:20:29,777 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 12:20:29,777 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 12:20:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-05-06 12:20:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-06 12:20:29,790 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:29,791 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:29,791 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1531213237, now seen corresponding path program 1 times [2021-05-06 12:20:29,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:29,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1188266228] [2021-05-06 12:20:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:29,834 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:29,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:29,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:29,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:29,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:29,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:29,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:29,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:29,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:29,975 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:29,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1188266228] [2021-05-06 12:20:29,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1188266228] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:29,976 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:29,976 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 12:20:29,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985190447] [2021-05-06 12:20:29,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 12:20:29,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 12:20:29,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 12:20:29,988 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:20:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:30,144 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2021-05-06 12:20:30,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 12:20:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2021-05-06 12:20:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:30,150 INFO L225 Difference]: With dead ends: 113 [2021-05-06 12:20:30,150 INFO L226 Difference]: Without dead ends: 56 [2021-05-06 12:20:30,152 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-06 12:20:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-06 12:20:30,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-05-06 12:20:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-06 12:20:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-05-06 12:20:30,181 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 49 [2021-05-06 12:20:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:30,181 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-05-06 12:20:30,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-05-06 12:20:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-05-06 12:20:30,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-06 12:20:30,182 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:30,183 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:30,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 12:20:30,183 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:30,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:30,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1121655349, now seen corresponding path program 1 times [2021-05-06 12:20:30,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:30,184 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [14024658] [2021-05-06 12:20:30,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:30,186 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-05-06 12:20:30,374 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:30,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [14024658] [2021-05-06 12:20:30,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [14024658] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:30,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:30,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-06 12:20:30,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219945857] [2021-05-06 12:20:30,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-06 12:20:30,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:30,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-06 12:20:30,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-05-06 12:20:30,376 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-06 12:20:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:30,848 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2021-05-06 12:20:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-06 12:20:30,848 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2021-05-06 12:20:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:30,849 INFO L225 Difference]: With dead ends: 84 [2021-05-06 12:20:30,850 INFO L226 Difference]: Without dead ends: 63 [2021-05-06 12:20:30,851 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 284.2ms TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2021-05-06 12:20:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-06 12:20:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2021-05-06 12:20:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-06 12:20:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2021-05-06 12:20:30,860 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 49 [2021-05-06 12:20:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:30,861 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2021-05-06 12:20:30,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-06 12:20:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2021-05-06 12:20:30,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-06 12:20:30,862 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:30,862 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:30,862 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 12:20:30,862 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2096379008, now seen corresponding path program 1 times [2021-05-06 12:20:30,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:30,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1289090601] [2021-05-06 12:20:30,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:30,865 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:30,960 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:30,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1289090601] [2021-05-06 12:20:30,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1289090601] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:30,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:30,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-06 12:20:30,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796129197] [2021-05-06 12:20:30,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 12:20:30,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 12:20:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-05-06 12:20:30,961 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-05-06 12:20:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:31,229 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2021-05-06 12:20:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 12:20:31,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 50 [2021-05-06 12:20:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:31,230 INFO L225 Difference]: With dead ends: 75 [2021-05-06 12:20:31,230 INFO L226 Difference]: Without dead ends: 73 [2021-05-06 12:20:31,231 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 118.3ms TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-05-06 12:20:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-06 12:20:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2021-05-06 12:20:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2021-05-06 12:20:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2021-05-06 12:20:31,240 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2021-05-06 12:20:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:31,240 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2021-05-06 12:20:31,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-05-06 12:20:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2021-05-06 12:20:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-05-06 12:20:31,241 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:31,241 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:31,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 12:20:31,242 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash 983031743, now seen corresponding path program 1 times [2021-05-06 12:20:31,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:31,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [654731755] [2021-05-06 12:20:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:31,244 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:31,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:31,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:31,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:31,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:31,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:31,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:31,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:31,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-05-06 12:20:31,523 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:31,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [654731755] [2021-05-06 12:20:31,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [654731755] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:31,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:31,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-06 12:20:31,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015474904] [2021-05-06 12:20:31,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-06 12:20:31,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:31,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-06 12:20:31,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-05-06 12:20:31,525 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-06 12:20:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:32,422 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2021-05-06 12:20:32,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-06 12:20:32,422 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2021-05-06 12:20:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:32,424 INFO L225 Difference]: With dead ends: 114 [2021-05-06 12:20:32,424 INFO L226 Difference]: Without dead ends: 74 [2021-05-06 12:20:32,425 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 766.1ms TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2021-05-06 12:20:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-06 12:20:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2021-05-06 12:20:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2021-05-06 12:20:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2021-05-06 12:20:32,433 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 52 [2021-05-06 12:20:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:32,434 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2021-05-06 12:20:32,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 6 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2021-05-06 12:20:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2021-05-06 12:20:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-06 12:20:32,435 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:32,435 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:32,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 12:20:32,435 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash 2045094069, now seen corresponding path program 1 times [2021-05-06 12:20:32,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:32,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [39837816] [2021-05-06 12:20:32,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:32,437 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:32,498 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:32,498 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [39837816] [2021-05-06 12:20:32,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [39837816] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:32,499 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:32,499 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 12:20:32,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514030617] [2021-05-06 12:20:32,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 12:20:32,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:32,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 12:20:32,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 12:20:32,500 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-05-06 12:20:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:32,715 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2021-05-06 12:20:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 12:20:32,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2021-05-06 12:20:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:32,716 INFO L225 Difference]: With dead ends: 88 [2021-05-06 12:20:32,716 INFO L226 Difference]: Without dead ends: 67 [2021-05-06 12:20:32,717 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 112.1ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-05-06 12:20:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-06 12:20:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-06 12:20:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2021-05-06 12:20:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2021-05-06 12:20:32,725 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 55 [2021-05-06 12:20:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:32,725 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2021-05-06 12:20:32,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-05-06 12:20:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2021-05-06 12:20:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-06 12:20:32,726 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:32,726 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:32,726 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 12:20:32,726 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:32,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash 629236887, now seen corresponding path program 1 times [2021-05-06 12:20:32,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:32,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884547541] [2021-05-06 12:20:32,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:32,728 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-06 12:20:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:32,956 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:32,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884547541] [2021-05-06 12:20:32,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1884547541] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:32,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:32,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-06 12:20:32,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686456761] [2021-05-06 12:20:32,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-06 12:20:32,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:32,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-06 12:20:32,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-05-06 12:20:32,957 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:20:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:33,686 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2021-05-06 12:20:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-06 12:20:33,686 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2021-05-06 12:20:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:33,687 INFO L225 Difference]: With dead ends: 101 [2021-05-06 12:20:33,687 INFO L226 Difference]: Without dead ends: 87 [2021-05-06 12:20:33,688 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 487.2ms TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2021-05-06 12:20:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-06 12:20:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2021-05-06 12:20:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2021-05-06 12:20:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2021-05-06 12:20:33,698 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 57 [2021-05-06 12:20:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:33,698 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2021-05-06 12:20:33,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:20:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2021-05-06 12:20:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-05-06 12:20:33,699 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:33,699 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:33,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 12:20:33,699 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:33,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1636680555, now seen corresponding path program 2 times [2021-05-06 12:20:33,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:33,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007011215] [2021-05-06 12:20:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:33,701 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:33,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:33,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:33,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:33,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:34,138 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2021-05-06 12:20:34,277 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2021-05-06 12:20:34,409 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2021-05-06 12:20:34,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:34,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:34,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:34,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-05-06 12:20:34,726 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:34,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007011215] [2021-05-06 12:20:34,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2007011215] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:34,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:34,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-06 12:20:34,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187330567] [2021-05-06 12:20:34,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-06 12:20:34,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-06 12:20:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2021-05-06 12:20:34,727 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-05-06 12:20:35,358 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2021-05-06 12:20:35,566 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2021-05-06 12:20:35,761 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2021-05-06 12:20:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:36,884 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2021-05-06 12:20:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-06 12:20:36,885 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2021-05-06 12:20:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:36,886 INFO L225 Difference]: With dead ends: 131 [2021-05-06 12:20:36,886 INFO L226 Difference]: Without dead ends: 93 [2021-05-06 12:20:36,887 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2246.3ms TimeCoverageRelationStatistics Valid=219, Invalid=1503, Unknown=0, NotChecked=0, Total=1722 [2021-05-06 12:20:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-06 12:20:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2021-05-06 12:20:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2021-05-06 12:20:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2021-05-06 12:20:36,897 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 58 [2021-05-06 12:20:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:36,897 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2021-05-06 12:20:36,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-05-06 12:20:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2021-05-06 12:20:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-06 12:20:36,898 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:36,898 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:36,898 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 12:20:36,898 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:36,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:36,899 INFO L82 PathProgramCache]: Analyzing trace with hash 596047115, now seen corresponding path program 3 times [2021-05-06 12:20:36,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:36,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1621410530] [2021-05-06 12:20:36,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:36,900 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:36,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:36,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:36,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:36,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:36,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:36,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:36,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:36,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:37,000 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:37,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1621410530] [2021-05-06 12:20:37,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1621410530] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:37,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:37,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-06 12:20:37,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974332369] [2021-05-06 12:20:37,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 12:20:37,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:37,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 12:20:37,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-05-06 12:20:37,002 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-05-06 12:20:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:37,421 INFO L93 Difference]: Finished difference Result 129 states and 158 transitions. [2021-05-06 12:20:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-06 12:20:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2021-05-06 12:20:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:37,423 INFO L225 Difference]: With dead ends: 129 [2021-05-06 12:20:37,423 INFO L226 Difference]: Without dead ends: 92 [2021-05-06 12:20:37,423 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 289.1ms TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2021-05-06 12:20:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-05-06 12:20:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2021-05-06 12:20:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 63 states have internal predecessors, (73), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2021-05-06 12:20:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2021-05-06 12:20:37,435 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 61 [2021-05-06 12:20:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:37,435 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2021-05-06 12:20:37,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-05-06 12:20:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2021-05-06 12:20:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-06 12:20:37,436 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:37,436 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:37,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-06 12:20:37,436 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:37,436 INFO L82 PathProgramCache]: Analyzing trace with hash 645513954, now seen corresponding path program 1 times [2021-05-06 12:20:37,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:37,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167781074] [2021-05-06 12:20:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:37,437 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-06 12:20:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-06 12:20:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:37,514 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:37,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167781074] [2021-05-06 12:20:37,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [167781074] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:37,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:37,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-06 12:20:37,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661772023] [2021-05-06 12:20:37,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 12:20:37,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:37,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 12:20:37,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-05-06 12:20:37,515 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-05-06 12:20:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:37,827 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2021-05-06 12:20:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 12:20:37,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2021-05-06 12:20:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:37,828 INFO L225 Difference]: With dead ends: 109 [2021-05-06 12:20:37,828 INFO L226 Difference]: Without dead ends: 98 [2021-05-06 12:20:37,828 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 128.3ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-05-06 12:20:37,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-06 12:20:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2021-05-06 12:20:37,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2021-05-06 12:20:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2021-05-06 12:20:37,839 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 64 [2021-05-06 12:20:37,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:37,839 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2021-05-06 12:20:37,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-05-06 12:20:37,839 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2021-05-06 12:20:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-05-06 12:20:37,840 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:37,840 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:37,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-06 12:20:37,840 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:37,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:37,840 INFO L82 PathProgramCache]: Analyzing trace with hash 643666912, now seen corresponding path program 1 times [2021-05-06 12:20:37,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:37,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849999517] [2021-05-06 12:20:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:37,842 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-06 12:20:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-06 12:20:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:37,936 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:37,936 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849999517] [2021-05-06 12:20:37,936 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1849999517] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:37,936 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:37,936 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-06 12:20:37,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456964536] [2021-05-06 12:20:37,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-06 12:20:37,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:37,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-06 12:20:37,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-05-06 12:20:37,937 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-05-06 12:20:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:38,331 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2021-05-06 12:20:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-06 12:20:38,332 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2021-05-06 12:20:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:38,332 INFO L225 Difference]: With dead ends: 104 [2021-05-06 12:20:38,333 INFO L226 Difference]: Without dead ends: 102 [2021-05-06 12:20:38,333 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 201.5ms TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-05-06 12:20:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-05-06 12:20:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2021-05-06 12:20:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2021-05-06 12:20:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2021-05-06 12:20:38,343 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 64 [2021-05-06 12:20:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:38,344 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2021-05-06 12:20:38,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-05-06 12:20:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2021-05-06 12:20:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-06 12:20:38,344 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:38,344 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:38,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-06 12:20:38,345 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:38,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:38,345 INFO L82 PathProgramCache]: Analyzing trace with hash -781730101, now seen corresponding path program 1 times [2021-05-06 12:20:38,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:38,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1741142548] [2021-05-06 12:20:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:38,346 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-05-06 12:20:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:38,620 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:38,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1741142548] [2021-05-06 12:20:38,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1741142548] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:38,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:38,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-06 12:20:38,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811506630] [2021-05-06 12:20:38,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-06 12:20:38,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-06 12:20:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-05-06 12:20:38,621 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:20:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:39,448 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2021-05-06 12:20:39,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-06 12:20:39,448 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2021-05-06 12:20:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:39,449 INFO L225 Difference]: With dead ends: 111 [2021-05-06 12:20:39,449 INFO L226 Difference]: Without dead ends: 109 [2021-05-06 12:20:39,450 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 597.1ms TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2021-05-06 12:20:39,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-06 12:20:39,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2021-05-06 12:20:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2021-05-06 12:20:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2021-05-06 12:20:39,460 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 66 [2021-05-06 12:20:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:39,460 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2021-05-06 12:20:39,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:20:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2021-05-06 12:20:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-06 12:20:39,461 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:39,461 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:39,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-06 12:20:39,461 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:39,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:39,461 INFO L82 PathProgramCache]: Analyzing trace with hash -779883059, now seen corresponding path program 1 times [2021-05-06 12:20:39,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:39,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1204955852] [2021-05-06 12:20:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:39,463 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-05-06 12:20:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:39,597 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:39,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1204955852] [2021-05-06 12:20:39,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1204955852] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:39,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:39,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-06 12:20:39,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222858998] [2021-05-06 12:20:39,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 12:20:39,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 12:20:39,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-05-06 12:20:39,598 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:20:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:40,121 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2021-05-06 12:20:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 12:20:40,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2021-05-06 12:20:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:40,122 INFO L225 Difference]: With dead ends: 124 [2021-05-06 12:20:40,122 INFO L226 Difference]: Without dead ends: 106 [2021-05-06 12:20:40,122 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 275.6ms TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2021-05-06 12:20:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-05-06 12:20:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2021-05-06 12:20:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2021-05-06 12:20:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2021-05-06 12:20:40,132 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 66 [2021-05-06 12:20:40,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:40,132 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2021-05-06 12:20:40,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-05-06 12:20:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2021-05-06 12:20:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-05-06 12:20:40,133 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:40,133 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:40,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-06 12:20:40,133 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:40,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash 297933182, now seen corresponding path program 1 times [2021-05-06 12:20:40,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:40,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1164422365] [2021-05-06 12:20:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:40,134 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-06 12:20:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-06 12:20:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-06 12:20:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:40,322 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:40,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1164422365] [2021-05-06 12:20:40,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1164422365] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:40,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:40,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-06 12:20:40,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665496598] [2021-05-06 12:20:40,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-06 12:20:40,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:40,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-06 12:20:40,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-05-06 12:20:40,323 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-05-06 12:20:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:40,870 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2021-05-06 12:20:40,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 12:20:40,871 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 70 [2021-05-06 12:20:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:40,871 INFO L225 Difference]: With dead ends: 110 [2021-05-06 12:20:40,872 INFO L226 Difference]: Without dead ends: 108 [2021-05-06 12:20:40,872 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 352.0ms TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2021-05-06 12:20:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-05-06 12:20:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2021-05-06 12:20:40,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 73 states have internal predecessors, (83), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2021-05-06 12:20:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2021-05-06 12:20:40,885 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 70 [2021-05-06 12:20:40,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:40,886 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2021-05-06 12:20:40,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-05-06 12:20:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2021-05-06 12:20:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-06 12:20:40,886 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:40,886 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:40,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-06 12:20:40,886 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1867983073, now seen corresponding path program 4 times [2021-05-06 12:20:40,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:40,887 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2141586584] [2021-05-06 12:20:40,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:40,888 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:41,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:41,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:41,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:41,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:41,268 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 28 [2021-05-06 12:20:41,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:41,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:41,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:41,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:41,723 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2021-05-06 12:20:42,161 WARN L205 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2021-05-06 12:20:42,508 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2021-05-06 12:20:42,873 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 64 [2021-05-06 12:20:43,119 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 44 [2021-05-06 12:20:43,335 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2021-05-06 12:20:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-05-06 12:20:43,655 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:43,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2141586584] [2021-05-06 12:20:43,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2141586584] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:43,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:43,655 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-06 12:20:43,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529542204] [2021-05-06 12:20:43,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-06 12:20:43,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:43,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-06 12:20:43,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2021-05-06 12:20:43,656 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 27 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-05-06 12:20:44,959 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2021-05-06 12:20:45,353 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 122 [2021-05-06 12:20:45,839 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 110 [2021-05-06 12:20:46,291 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 118 [2021-05-06 12:20:47,006 WARN L205 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 146 [2021-05-06 12:20:47,427 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2021-05-06 12:20:47,698 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 105 [2021-05-06 12:20:47,919 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 76 [2021-05-06 12:20:48,235 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2021-05-06 12:20:48,476 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 88 [2021-05-06 12:20:48,816 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 84 [2021-05-06 12:20:49,611 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 105 [2021-05-06 12:20:50,082 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 95 [2021-05-06 12:20:50,460 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 112 [2021-05-06 12:20:51,041 WARN L205 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 119 [2021-05-06 12:20:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:51,390 INFO L93 Difference]: Finished difference Result 151 states and 181 transitions. [2021-05-06 12:20:51,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-06 12:20:51,390 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2021-05-06 12:20:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:51,391 INFO L225 Difference]: With dead ends: 151 [2021-05-06 12:20:51,391 INFO L226 Difference]: Without dead ends: 93 [2021-05-06 12:20:51,392 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 8469.4ms TimeCoverageRelationStatistics Valid=692, Invalid=3214, Unknown=0, NotChecked=0, Total=3906 [2021-05-06 12:20:51,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-06 12:20:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2021-05-06 12:20:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.11864406779661) internal successors, (66), 60 states have internal predecessors, (66), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2021-05-06 12:20:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2021-05-06 12:20:51,403 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 67 [2021-05-06 12:20:51,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:51,404 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2021-05-06 12:20:51,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 5 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-05-06 12:20:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2021-05-06 12:20:51,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-05-06 12:20:51,404 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:51,404 INFO L523 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:51,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-06 12:20:51,405 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:51,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash 680409498, now seen corresponding path program 1 times [2021-05-06 12:20:51,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:51,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950129947] [2021-05-06 12:20:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:51,406 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-06 12:20:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-05-06 12:20:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-05-06 12:20:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-05-06 12:20:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-05-06 12:20:51,763 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:51,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950129947] [2021-05-06 12:20:51,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [950129947] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:51,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:51,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-06 12:20:51,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109077798] [2021-05-06 12:20:51,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-06 12:20:51,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:51,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-06 12:20:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-05-06 12:20:51,764 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 19 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-05-06 12:20:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:52,728 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2021-05-06 12:20:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-06 12:20:52,728 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 76 [2021-05-06 12:20:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:52,729 INFO L225 Difference]: With dead ends: 94 [2021-05-06 12:20:52,729 INFO L226 Difference]: Without dead ends: 76 [2021-05-06 12:20:52,729 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 697.6ms TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2021-05-06 12:20:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-06 12:20:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2021-05-06 12:20:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-06 12:20:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2021-05-06 12:20:52,739 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 76 [2021-05-06 12:20:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:52,740 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2021-05-06 12:20:52,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-05-06 12:20:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-05-06 12:20:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-06 12:20:52,740 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:52,740 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:52,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-06 12:20:52,740 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1166734282, now seen corresponding path program 1 times [2021-05-06 12:20:52,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:52,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [7530794] [2021-05-06 12:20:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:52,742 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-05-06 12:20:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-05-06 12:20:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-06 12:20:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-05-06 12:20:52,910 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:52,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [7530794] [2021-05-06 12:20:52,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [7530794] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:52,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:52,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-06 12:20:52,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477444008] [2021-05-06 12:20:52,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-06 12:20:52,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:52,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-06 12:20:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-05-06 12:20:52,911 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-05-06 12:20:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:53,377 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2021-05-06 12:20:53,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-06 12:20:53,377 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 79 [2021-05-06 12:20:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:53,378 INFO L225 Difference]: With dead ends: 79 [2021-05-06 12:20:53,378 INFO L226 Difference]: Without dead ends: 77 [2021-05-06 12:20:53,378 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 311.5ms TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-05-06 12:20:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-06 12:20:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2021-05-06 12:20:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-05-06 12:20:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2021-05-06 12:20:53,405 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 79 [2021-05-06 12:20:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:53,405 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2021-05-06 12:20:53,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-05-06 12:20:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-05-06 12:20:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-06 12:20:53,406 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 12:20:53,406 INFO L523 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 12:20:53,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-06 12:20:53,406 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 12:20:53,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 12:20:53,406 INFO L82 PathProgramCache]: Analyzing trace with hash 690301670, now seen corresponding path program 1 times [2021-05-06 12:20:53,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 12:20:53,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [691592704] [2021-05-06 12:20:53,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 12:20:53,407 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 12:20:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 12:20:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 12:20:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-06 12:20:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-06 12:20:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 12:20:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-06 12:20:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-05-06 12:20:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-05-06 12:20:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-05-06 12:20:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-06 12:20:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-05-06 12:20:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 12:20:53,768 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-05-06 12:20:53,768 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 12:20:53,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [691592704] [2021-05-06 12:20:53,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [691592704] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 12:20:53,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 12:20:53,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-06 12:20:53,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461228099] [2021-05-06 12:20:53,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-06 12:20:53,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 12:20:53,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-06 12:20:53,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2021-05-06 12:20:53,769 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 17 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2021-05-06 12:20:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 12:20:54,469 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2021-05-06 12:20:54,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-06 12:20:54,469 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 85 [2021-05-06 12:20:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 12:20:54,470 INFO L225 Difference]: With dead ends: 75 [2021-05-06 12:20:54,470 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 12:20:54,470 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 544.3ms TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2021-05-06 12:20:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 12:20:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 12:20:54,470 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) [2021-05-06 12:20:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 12:20:54,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2021-05-06 12:20:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 12:20:54,471 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 12:20:54,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2021-05-06 12:20:54,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 12:20:54,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 12:20:54,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-06 12:20:54,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 12:20:54,605 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 224 [2021-05-06 12:20:56,059 WARN L205 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 122 [2021-05-06 12:20:56,265 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2021-05-06 12:20:56,489 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2021-05-06 12:20:57,641 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 194 DAG size of output: 139 [2021-05-06 12:20:57,974 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 87 [2021-05-06 12:20:58,126 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2021-05-06 12:20:58,228 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-05-06 12:20:58,360 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2021-05-06 12:20:58,706 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2021-05-06 12:21:00,286 WARN L205 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 204 DAG size of output: 156 [2021-05-06 12:21:01,328 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 177 DAG size of output: 125 [2021-05-06 12:21:01,556 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2021-05-06 12:21:01,728 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-05-06 12:21:01,956 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2021-05-06 12:21:02,624 WARN L205 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 122 [2021-05-06 12:21:05,405 WARN L205 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 250 DAG size of output: 165 [2021-05-06 12:21:05,545 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2021-05-06 12:21:05,545 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2021-05-06 12:21:05,545 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2021-05-06 12:21:05,545 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 12:21:05,545 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#t~string6.offset)| |#t~string6.offset|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string7.offset| |old(#t~string7.offset)|) (= |old(#t~string7.base)| |#t~string7.base|) (= |old(#valid)| |#valid|)) [2021-05-06 12:21:05,545 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 12:21:05,545 INFO L194 CegarLoopUtils]: At program point finddupENTRY(lines 33 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-05-06 12:21:05,546 INFO L194 CegarLoopUtils]: At program point finddupEXIT(lines 33 46) the Hoare annotation is: (let ((.cse24 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse12 (not (= |finddup_#in~a.offset| 0))) (.cse17 (<= 1 finddup_~i~1)) (.cse19 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse14 (<= |finddup_#res| 1)) (.cse20 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse21 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse16 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse8 (= |finddup_#in~n| finddup_~n)) (.cse2 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)) (.cse4 (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (.cse13 (<= 1 |finddup_#res|)) (.cse18 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse3 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (let ((.cse7 (<= finddup_~n 1)) (.cse5 (let ((.cse28 (<= 1 .cse3)) (.cse29 (<= (+ .cse3 1) |finddup_#in~n|)) (.cse27 (+ finddup_~j~1 1))) (or (and (<= .cse27 finddup_~n) .cse19 .cse14 .cse20 .cse21 .cse16 .cse28 .cse8 (or (= .cse2 0) .cse4) .cse13 .cse18 .cse29 (= finddup_~i~1 0)) (and (or (<= (+ .cse2 2) |finddup_#in~n|) .cse4) .cse17 .cse19 .cse14 .cse20 .cse21 .cse16 .cse28 .cse8 (or (<= 1 .cse2) .cse4) .cse13 .cse18 .cse29 (<= .cse27 |finddup_#in~n|))))) (.cse9 (or (and (not (= (select .cse24 (+ (* finddup_~n 4) (- 4))) (select .cse24 0))) (<= finddup_~n 2)) .cse12)) (.cse10 (* 4 finddup_~j~1)) (.cse11 (* 4 finddup_~n)) (.cse0 (= |finddup_#in~a.base| finddup_~a.base)) (.cse6 (= |#memory_int| |old(#memory_int)|)) (.cse15 (let ((.cse23 ((as const (Array Int Int)) 0))) (let ((.cse25 (@diff .cse24 .cse23))) (let ((.cse22 (store .cse24 .cse25 0))) (let ((.cse26 (@diff .cse22 .cse23))) (or (and (not (= .cse22 .cse23)) (not (= (select .cse24 .cse25) (select .cse24 .cse26)))) (not (= .cse23 (store .cse22 .cse26 0)))))))))) (or (and .cse0 (or (let ((.cse1 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse1 (+ (* .cse2 4) |finddup_#in~a.offset|)) (select .cse1 (+ |finddup_#in~a.offset| (* .cse3 4))))) (= |finddup_#in~_i.base| |finddup_#in~a.base|) .cse4 (= |finddup_#in~_j.base| |finddup_#in~a.base|)) (or .cse4 (<= (+ .cse2 1) .cse3)) .cse5 (= finddup_~a.offset |finddup_#in~a.offset|)) (and .cse6 .cse7 .cse8) (and .cse9 .cse6 (or (<= .cse10 .cse11) .cse12) .cse8) (and .cse13 (<= finddup_~i~1 0) .cse7 .cse14 .cse8 (<= finddup_~j~1 1)) (and .cse15 .cse5) (and .cse13 .cse9 (<= (+ finddup_~i~1 2) finddup_~n) .cse14 .cse16 .cse8 (or (<= (+ .cse10 4) .cse11) .cse12)) (and .cse0 .cse17 (<= 1 finddup_~j~1) .cse6 .cse18 .cse19 .cse15 .cse20 .cse21 .cse8)))) [2021-05-06 12:21:05,547 INFO L194 CegarLoopUtils]: At program point L38(lines 38 42) the Hoare annotation is: (let ((.cse31 (* finddup_~j~1 4)) (.cse46 (* finddup_~i~1 4))) (let ((.cse4 ((as const (Array Int Int)) 0)) (.cse48 (+ finddup_~a.offset .cse46)) (.cse29 (select |#memory_int| finddup_~a.base)) (.cse49 (+ .cse31 finddup_~a.offset))) (let ((.cse26 (select .cse29 .cse49)) (.cse25 (select .cse29 .cse48)) (.cse30 (@diff .cse29 .cse4))) (let ((.cse5 (store .cse29 .cse30 0)) (.cse44 (= .cse25 0)) (.cse1 (= .cse26 0))) (let ((.cse28 (not .cse1)) (.cse27 (not .cse44)) (.cse37 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse43 (and (= |finddup_#t~mem14| .cse26) (= |finddup_#t~mem13| .cse25))) (.cse15 (<= 1 finddup_~i~1)) (.cse16 (= |#memory_int| |old(#memory_int)|)) (.cse22 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse17 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse18 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse19 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse24 (<= (+ finddup_~j~1 1) |finddup_#in~n|)) (.cse35 (= finddup_~i~1 0)) (.cse21 (= |finddup_#in~n| finddup_~n)) (.cse39 (+ finddup_~i~1 2)) (.cse6 (@diff .cse5 .cse4))) (let ((.cse2 (= .cse49 (+ .cse30 4))) (.cse7 (= .cse49 (+ .cse6 4))) (.cse3 (< .cse39 finddup_~j~1)) (.cse9 (or (and .cse15 .cse16 .cse22 .cse17 .cse18 .cse19 .cse24 .cse21) (and .cse16 .cse22 .cse17 (or (= .cse48 |finddup_#in~a.offset|) (= .cse48 0)) .cse18 .cse19 .cse24 .cse35 .cse21))) (.cse10 (or .cse1 .cse43 (< (+ finddup_~i~1 3) finddup_~n))) (.cse11 (<= .cse39 finddup_~j~1)) (.cse14 (or (= |finddup_#in~_i.base| |finddup_#in~a.base|) (let ((.cse45 (select (let ((.cse47 (store |#memory_int| finddup_~_i.base (store (select |#memory_int| finddup_~_i.base) finddup_~_i.offset finddup_~i~1)))) (store .cse47 finddup_~_j.base (store (select .cse47 finddup_~_j.base) finddup_~_j.offset finddup_~j~1))) |finddup_#in~a.base|))) (and (= |finddup_#t~mem14| (select .cse45 (+ .cse31 |finddup_#in~a.offset|))) (= (select .cse45 (+ .cse46 |finddup_#in~a.offset|)) |finddup_#t~mem13|))) (= |finddup_#in~_j.base| |finddup_#in~a.base|))) (.cse23 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse36 (<= finddup_~j~1 1)) (.cse12 (or .cse1 .cse43 .cse44)) (.cse0 (= |finddup_#in~a.base| finddup_~a.base)) (.cse8 (let ((.cse41 (@diff .cse37 .cse4))) (let ((.cse40 (store .cse37 .cse41 0))) (let ((.cse42 (@diff .cse40 .cse4))) (or (and (not (= .cse40 .cse4)) (not (= (select .cse37 .cse41) (select .cse37 .cse42)))) (not (= .cse4 (store .cse40 .cse42 0)))))))) (.cse13 (or .cse28 .cse27 (= |finddup_#t~mem14| |finddup_#t~mem13|))) (.cse34 (select .cse37 (+ (* finddup_~n 4) (- 4)))) (.cse20 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse32 (+ (* 4 finddup_~j~1) 4)) (.cse33 (* 4 finddup_~n))) (or (and .cse0 (or .cse1 .cse2 .cse3 (not (= .cse4 (store .cse5 .cse6 0))) .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse12 .cse21 .cse0 .cse22 .cse23 .cse24 (or (= .cse25 .cse26) (<= (+ finddup_~j~1 2) finddup_~n)) .cse13) (and .cse14 .cse0 (or (and (or .cse1 .cse2 .cse27 (and (not (= .cse5 .cse4)) .cse7)) (or .cse28 (not (= (select .cse29 .cse30) .cse25)) (= (select .cse29 (+ .cse31 finddup_~a.offset (- 4))) .cse26)) (not (= .cse4 .cse29))) .cse3) .cse9 .cse23 .cse10 .cse11 .cse12 .cse13) (and .cse14 (or (< .cse32 .cse33) (= |finddup_#t~mem14| .cse34)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse12 .cse21 .cse0 .cse22 .cse23 .cse35 .cse36 .cse13) (and (<= finddup_~i~1 0) .cse16 (<= finddup_~n 1) .cse21 .cse36) (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse12 .cse21 .cse0 .cse22 .cse8 .cse24 .cse13) (let ((.cse38 (not (= |finddup_#in~a.offset| 0)))) (and (or (and (not (= .cse34 (select .cse37 0))) (<= finddup_~n 2)) .cse38) .cse16 (<= .cse39 finddup_~n) .cse20 .cse21 (or (<= .cse32 .cse33) .cse38)))))))))) [2021-05-06 12:21:05,547 INFO L194 CegarLoopUtils]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse6 (select |#memory_int| finddup_~a.base)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse7 (@diff .cse6 .cse4))) (let ((.cse3 (store .cse6 .cse7 0)) (.cse9 (* finddup_~j~1 4))) (let ((.cse41 (+ .cse9 finddup_~a.offset)) (.cse28 (@diff .cse3 .cse4))) (let ((.cse35 (+ finddup_~i~1 1)) (.cse33 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse29 (* finddup_~n 4)) (.cse8 (select .cse6 (+ finddup_~a.offset (* finddup_~i~1 4)))) (.cse26 (+ .cse28 4)) (.cse39 (+ finddup_~i~1 2)) (.cse27 (+ .cse7 4)) (.cse10 (select .cse6 .cse41)) (.cse40 (+ finddup_~i~1 3))) (let ((.cse15 (<= .cse40 finddup_~n)) (.cse0 (= .cse10 0)) (.cse1 (= .cse41 .cse27)) (.cse11 (< .cse39 finddup_~j~1)) (.cse5 (= .cse41 .cse26)) (.cse21 (< .cse40 finddup_~n)) (.cse2 (not (= .cse8 0))) (.cse22 (= (select .cse6 (+ .cse29 finddup_~a.offset (- 4))) (select .cse6 (+ .cse29 finddup_~a.offset (- 8))))) (.cse17 (<= .cse39 finddup_~j~1)) (.cse23 (<= 0 finddup_~i~1)) (.cse19 (= |finddup_#in~a.base| finddup_~a.base)) (.cse20 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse13 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse30 (let ((.cse37 (@diff .cse33 .cse4))) (let ((.cse36 (store .cse33 .cse37 0))) (let ((.cse38 (@diff .cse36 .cse4))) (or (and (not (= .cse36 .cse4)) (not (= (select .cse33 .cse37) (select .cse33 .cse38)))) (not (= .cse4 (store .cse36 .cse38 0)))))))) (.cse14 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse16 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse31 (<= .cse35 finddup_~n)) (.cse12 (= |#memory_int| |old(#memory_int)|)) (.cse32 (<= .cse35 finddup_~j~1)) (.cse18 (= |finddup_#in~n| finddup_~n))) (or (and (or (and (or .cse0 .cse1 .cse2 (and (not (= .cse3 .cse4)) .cse5)) (or (not .cse0) (not (= (select .cse6 .cse7) .cse8)) (= (select .cse6 (+ .cse9 finddup_~a.offset (- 4))) .cse10)) (not (= .cse4 .cse6))) .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (or .cse21 .cse22) (= finddup_~a.offset |finddup_#in~a.offset|) .cse23) (let ((.cse24 (not (= .cse4 (store .cse3 .cse28 0))))) (and .cse12 .cse13 .cse14 .cse15 .cse16 (or .cse0 .cse1 .cse2 .cse11 .cse24 .cse5) (let ((.cse25 (+ .cse29 finddup_~a.offset))) (or .cse21 .cse2 .cse22 (and (= (+ .cse7 8) .cse25) (= .cse26 .cse25)) (and (= .cse27 .cse25) (= (+ .cse28 8) .cse25)) .cse24)) .cse17 .cse18 .cse19 .cse20 .cse30 .cse23)) (and .cse19 .cse31 (<= 1 finddup_~i~1) .cse12 .cse20 .cse13 .cse30 .cse14 .cse16 .cse32 .cse18) (and (<= finddup_~i~1 0) .cse12 (<= finddup_~n 1) .cse18) (let ((.cse34 (not (= |finddup_#in~a.offset| 0)))) (and .cse31 (or (and (not (= (select .cse33 (+ .cse29 (- 4))) (select .cse33 0))) (<= finddup_~n 2)) .cse34) .cse12 (or (<= (* 4 finddup_~j~1) (* 4 finddup_~n)) .cse34) .cse32 .cse18))))))))) [2021-05-06 12:21:05,547 INFO L194 CegarLoopUtils]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse3 (* finddup_~n 4)) (.cse1 (<= 1 finddup_~i~1)) (.cse11 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse0 (= |finddup_#in~a.base| finddup_~a.base)) (.cse4 (= |#memory_int| |old(#memory_int)|)) (.cse5 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse6 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse7 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse8 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse9 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse10 (= |finddup_#in~n| finddup_~n))) (or (and .cse0 .cse1 (or (<= (+ finddup_~i~1 3) finddup_~n) (let ((.cse2 (select |#memory_int| finddup_~a.base))) (= (select .cse2 (+ finddup_~a.offset (* finddup_~i~1 4))) (select .cse2 (+ .cse3 finddup_~a.offset (- 4)))))) .cse4 (<= (+ finddup_~i~1 2) finddup_~n) .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ finddup_~i~1 1) finddup_~j~1) .cse10) (and .cse4 (<= finddup_~n 1) .cse10) (let ((.cse12 (not (= |finddup_#in~a.offset| 0)))) (and (or (and (not (= (select .cse11 (+ .cse3 (- 4))) (select .cse11 0))) (<= finddup_~n 2)) .cse12) .cse4 (or (<= (* 4 finddup_~j~1) (* 4 finddup_~n)) .cse12) .cse10)) (and .cse0 .cse1 (<= 1 finddup_~j~1) .cse4 .cse5 .cse6 (let ((.cse14 ((as const (Array Int Int)) 0))) (let ((.cse15 (@diff .cse11 .cse14))) (let ((.cse13 (store .cse11 .cse15 0))) (let ((.cse16 (@diff .cse13 .cse14))) (or (and (not (= .cse13 .cse14)) (not (= (select .cse11 .cse15) (select .cse11 .cse16)))) (not (= .cse14 (store .cse13 .cse16 0)))))))) .cse7 .cse8 .cse10) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= finddup_~i~1 0) .cse10))) [2021-05-06 12:21:05,547 INFO L194 CegarLoopUtils]: At program point L36-4(lines 36 44) the Hoare annotation is: (let ((.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse2 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse1 (= |finddup_#in~n| finddup_~n))) (or (and .cse0 (<= finddup_~n 1) .cse1) (let ((.cse3 (not (= |finddup_#in~a.offset| 0)))) (and (or (and (not (= (select .cse2 (+ (* finddup_~n 4) (- 4))) (select .cse2 0))) (<= finddup_~n 2)) .cse3) .cse0 (or (<= (* 4 finddup_~j~1) (* 4 finddup_~n)) .cse3) .cse1)) (and (= |finddup_#in~a.base| finddup_~a.base) (<= 1 finddup_~i~1) (<= 1 finddup_~j~1) .cse0 (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_j.base| finddup_~_j.base) (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse6 (@diff .cse2 .cse5))) (let ((.cse4 (store .cse2 .cse6 0))) (let ((.cse7 (@diff .cse4 .cse5))) (or (and (not (= .cse4 .cse5)) (not (= (select .cse2 .cse6) (select .cse2 .cse7)))) (not (= .cse5 (store .cse4 .cse7 0)))))))) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.offset| finddup_~_i.offset) .cse1))) [2021-05-06 12:21:05,548 INFO L194 CegarLoopUtils]: At program point finddupFINAL(lines 33 46) the Hoare annotation is: (let ((.cse24 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse12 (not (= |finddup_#in~a.offset| 0))) (.cse17 (<= 1 finddup_~i~1)) (.cse19 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse14 (<= |finddup_#res| 1)) (.cse20 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse21 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse16 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse8 (= |finddup_#in~n| finddup_~n)) (.cse2 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)) (.cse4 (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (.cse13 (<= 1 |finddup_#res|)) (.cse18 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse3 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (let ((.cse7 (<= finddup_~n 1)) (.cse5 (let ((.cse28 (<= 1 .cse3)) (.cse29 (<= (+ .cse3 1) |finddup_#in~n|)) (.cse27 (+ finddup_~j~1 1))) (or (and (<= .cse27 finddup_~n) .cse19 .cse14 .cse20 .cse21 .cse16 .cse28 .cse8 (or (= .cse2 0) .cse4) .cse13 .cse18 .cse29 (= finddup_~i~1 0)) (and (or (<= (+ .cse2 2) |finddup_#in~n|) .cse4) .cse17 .cse19 .cse14 .cse20 .cse21 .cse16 .cse28 .cse8 (or (<= 1 .cse2) .cse4) .cse13 .cse18 .cse29 (<= .cse27 |finddup_#in~n|))))) (.cse9 (or (and (not (= (select .cse24 (+ (* finddup_~n 4) (- 4))) (select .cse24 0))) (<= finddup_~n 2)) .cse12)) (.cse10 (* 4 finddup_~j~1)) (.cse11 (* 4 finddup_~n)) (.cse0 (= |finddup_#in~a.base| finddup_~a.base)) (.cse6 (= |#memory_int| |old(#memory_int)|)) (.cse15 (let ((.cse23 ((as const (Array Int Int)) 0))) (let ((.cse25 (@diff .cse24 .cse23))) (let ((.cse22 (store .cse24 .cse25 0))) (let ((.cse26 (@diff .cse22 .cse23))) (or (and (not (= .cse22 .cse23)) (not (= (select .cse24 .cse25) (select .cse24 .cse26)))) (not (= .cse23 (store .cse22 .cse26 0)))))))))) (or (and .cse0 (or (let ((.cse1 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse1 (+ (* .cse2 4) |finddup_#in~a.offset|)) (select .cse1 (+ |finddup_#in~a.offset| (* .cse3 4))))) (= |finddup_#in~_i.base| |finddup_#in~a.base|) .cse4 (= |finddup_#in~_j.base| |finddup_#in~a.base|)) (or .cse4 (<= (+ .cse2 1) .cse3)) .cse5 (= finddup_~a.offset |finddup_#in~a.offset|)) (and .cse6 .cse7 .cse8) (and .cse9 .cse6 (or (<= .cse10 .cse11) .cse12) .cse8) (and .cse13 (<= finddup_~i~1 0) .cse7 .cse14 .cse8 (<= finddup_~j~1 1)) (and .cse15 .cse5) (and .cse13 .cse9 (<= (+ finddup_~i~1 2) finddup_~n) .cse14 .cse16 .cse8 (or (<= (+ .cse10 4) .cse11) .cse12)) (and .cse0 .cse17 (<= 1 finddup_~j~1) .cse6 .cse18 .cse19 .cse15 .cse20 .cse21 .cse8)))) [2021-05-06 12:21:05,548 INFO L194 CegarLoopUtils]: At program point L37-2(lines 37 43) the Hoare annotation is: (let ((.cse24 (* finddup_~j~1 4))) (let ((.cse17 (+ .cse24 finddup_~a.offset)) (.cse23 (select |#memory_int| finddup_~a.base))) (let ((.cse19 (select .cse23 (+ finddup_~a.offset (* finddup_~i~1 4)))) (.cse25 (select .cse23 .cse17))) (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse1 (<= 1 finddup_~i~1)) (.cse13 (<= (+ finddup_~j~1 1) |finddup_#in~n|)) (.cse7 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse26 (+ finddup_~i~1 2)) (.cse0 (= |finddup_#in~a.base| finddup_~a.base)) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse4 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse10 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse11 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse16 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse12 (<= (+ finddup_~i~1 1) finddup_~j~1)) (.cse27 (= finddup_~i~1 0)) (.cse14 (not (= .cse19 .cse25))) (.cse15 (= |finddup_#in~n| finddup_~n)) (.cse28 (<= finddup_~j~1 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse8 (@diff .cse7 .cse6))) (let ((.cse5 (store .cse7 .cse8 0))) (let ((.cse9 (@diff .cse5 .cse6))) (or (and (not (= .cse5 .cse6)) (not (= (select .cse7 .cse8) (select .cse7 .cse9)))) (not (= .cse6 (store .cse5 .cse9 0))))))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse11 .cse16 .cse12 (<= (+ finddup_~j~1 2) finddup_~n) .cse14 .cse15) (and .cse0 (or (let ((.cse18 (@diff .cse23 .cse6))) (let ((.cse20 (store .cse23 .cse18 0))) (let ((.cse21 (@diff .cse20 .cse6))) (let ((.cse22 (not (= .cse6 (store .cse20 .cse21 0))))) (and (or (= .cse17 (+ .cse18 4)) (not (= .cse19 0)) (and (not (= .cse20 .cse6)) (= .cse17 (+ .cse21 4))) .cse22) (or (not (= (select .cse23 .cse18) .cse19)) (not (= .cse19 (select .cse23 .cse21))) .cse22 (= (select .cse23 (+ .cse24 finddup_~a.offset (- 4))) .cse25))))))) (< .cse26 finddup_~j~1)) (or (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse15) (and .cse2 .cse3 .cse4 .cse10 .cse11 .cse13 .cse27 .cse15)) .cse16 .cse14 (<= .cse26 finddup_~j~1)) (and (<= finddup_~i~1 0) .cse2 (<= finddup_~n 1) .cse15 .cse28) (let ((.cse29 (not (= |finddup_#in~a.offset| 0)))) (and (or (and (not (= (select .cse7 (+ (* finddup_~n 4) (- 4))) (select .cse7 0))) (<= finddup_~n 2)) .cse29) .cse2 (<= .cse26 finddup_~n) .cse12 .cse15 (or (<= (+ (* 4 finddup_~j~1) 4) (* 4 finddup_~n)) .cse29))) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse11 .cse16 .cse12 .cse27 .cse14 .cse15 .cse28)))))) [2021-05-06 12:21:05,548 INFO L194 CegarLoopUtils]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse35 (select |#memory_int| finddup_~a.base)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse28 (@diff .cse35 .cse7))) (let ((.cse44 (store .cse35 .cse28 0)) (.cse41 (* finddup_~j~1 4))) (let ((.cse42 (+ .cse41 finddup_~a.offset)) (.cse32 (@diff .cse44 .cse7)) (.cse16 (select .cse35 (+ finddup_~a.offset (* finddup_~i~1 4))))) (let ((.cse39 (+ finddup_~i~1 1)) (.cse25 (not (= (select .cse35 .cse28) .cse16))) (.cse26 (not (= .cse16 (select .cse35 .cse32)))) (.cse31 (+ .cse28 4)) (.cse27 (not (= .cse16 0))) (.cse23 (not (= .cse44 .cse7))) (.cse30 (+ .cse32 4)) (.cse33 (not (= .cse7 (store .cse44 .cse32 0)))) (.cse17 (select .cse35 .cse42)) (.cse43 (+ finddup_~i~1 2))) (let ((.cse2 (<= 1 finddup_~i~1)) (.cse22 (<= .cse43 finddup_~j~1)) (.cse20 (or (let ((.cse40 (= .cse17 0))) (and (or (not .cse40) .cse25 .cse26 .cse33 (= (select .cse35 (+ .cse41 finddup_~a.offset (- 4))) .cse17)) (or .cse40 (= .cse42 .cse31) .cse27 (and .cse23 (= .cse42 .cse30)) .cse33) (not (= .cse7 .cse35)))) (< .cse43 finddup_~j~1))) (.cse0 (= |finddup_#in~a.base| finddup_~a.base)) (.cse4 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse5 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse11 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse12 (= |finddup_#in~_i.offset| finddup_~_i.offset)) (.cse15 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse21 (= finddup_~i~1 0)) (.cse1 (<= .cse39 finddup_~n)) (.cse34 (* finddup_~n 4)) (.cse8 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse3 (= |#memory_int| |old(#memory_int)|)) (.cse18 (* 4 finddup_~j~1)) (.cse19 (* 4 finddup_~n)) (.cse13 (<= .cse39 finddup_~j~1)) (.cse14 (= |finddup_#in~n| finddup_~n))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (let ((.cse9 (@diff .cse8 .cse7))) (let ((.cse6 (store .cse8 .cse9 0))) (let ((.cse10 (@diff .cse6 .cse7))) (or (and (not (= .cse6 .cse7)) (not (= (select .cse8 .cse9) (select .cse8 .cse10)))) (not (= .cse7 (store .cse6 .cse10 0))))))) .cse11 .cse12 .cse13 .cse14) (and (<= finddup_~i~1 0) .cse3 (<= finddup_~n 1) .cse14) (and .cse0 .cse2 (<= (+ finddup_~j~1 1) finddup_~n) .cse3 .cse4 .cse5 .cse11 .cse12 .cse15 .cse13 (or (= .cse16 .cse17) (<= (+ finddup_~j~1 2) finddup_~n)) .cse14) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse12 .cse15 (< .cse18 .cse19) .cse20 .cse21 .cse22 .cse14) (let ((.cse36 (+ finddup_~i~1 3))) (and .cse0 (or (let ((.cse24 (= (select .cse35 (+ .cse34 finddup_~a.offset (- 4))) (select .cse35 (+ .cse34 finddup_~a.offset (- 8)))))) (and (or .cse23 .cse24) (let ((.cse29 (+ .cse34 finddup_~a.offset))) (or (and (or .cse25 .cse26) .cse27) .cse24 (and (= (+ .cse28 8) .cse29) (= .cse30 .cse29)) (and (= .cse31 .cse29) (= (+ .cse32 8) .cse29)) .cse33)))) (< .cse36 finddup_~n)) (let ((.cse37 (<= .cse36 finddup_~n))) (or (and .cse2 .cse3 .cse4 .cse5 .cse37 .cse11 .cse12 .cse22 .cse14) (and .cse3 .cse4 .cse5 .cse37 .cse11 .cse12 .cse21 .cse22 .cse14))) .cse20 .cse15)) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse12 .cse15 .cse13 .cse21 .cse14 (<= finddup_~j~1 1)) (let ((.cse38 (not (= |finddup_#in~a.offset| 0)))) (and .cse1 (or (and (not (= (select .cse8 (+ .cse34 (- 4))) (select .cse8 0))) (<= finddup_~n 2)) .cse38) .cse3 (or (<= .cse18 .cse19) .cse38) .cse13 .cse14))))))))) [2021-05-06 12:21:05,548 INFO L194 CegarLoopUtils]: At program point mkdupENTRY(lines 19 31) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-05-06 12:21:05,548 INFO L194 CegarLoopUtils]: At program point mkdupFINAL(lines 19 31) the Hoare annotation is: (let ((.cse7 (select |old(#memory_int)| |mkdup_#in~a.base|)) (.cse5 (select |#memory_int| |mkdup_#in~a.base|))) (let ((.cse11 (@diff .cse7 .cse5))) (let ((.cse0 (= mkdup_~j~0 0)) (.cse2 (= |mkdup_#in~a.offset| mkdup_~a.offset)) (.cse3 (= mkdup_~a.offset 0)) (.cse6 (select .cse5 .cse11))) (and (or (let ((.cse1 (= mkdup_~a.base |mkdup_#in~a.base|))) (and (or (not .cse0) .cse1) (or (and .cse2 (or (not (= (+ (* mkdup_~i~0 4) mkdup_~a.offset) 0)) .cse1)) (<= mkdup_~j~0 mkdup_~i~0)))) (not .cse3)) (not (= mkdup_~j~0 mkdup_~i~0)) (= |mkdup_#in~n| mkdup_~n) (or (and (< 0 mkdup_~j~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) .cse0) (or (not (let ((.cse4 ((as const (Array Int Int)) 0))) (= .cse4 (store .cse5 (@diff .cse5 .cse4) 0)))) (= .cse6 0) (= .cse7 .cse5)) (<= 0 mkdup_~i~0) (or (= (select .cse5 4) (select .cse5 0)) (not (= |mkdup_#in~a.offset| 0)) (< 8 (* 4 |mkdup_#in~n|))) (or .cse2 .cse3) (< mkdup_~i~0 mkdup_~n) (let ((.cse8 (store .cse7 .cse11 .cse6))) (or (= .cse8 .cse5) (let ((.cse10 (@diff .cse8 .cse5))) (let ((.cse9 (select .cse5 .cse10))) (and (= .cse9 .cse6) (= (store (store .cse7 .cse10 .cse9) .cse11 .cse6) .cse5)))))))))) [2021-05-06 12:21:05,549 INFO L194 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (= |mkdup_#in~a.offset| mkdup_~a.offset))) (and (not (= mkdup_~j~0 mkdup_~i~0)) (= |mkdup_#in~n| mkdup_~n) (or (and (< 0 mkdup_~j~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= mkdup_~j~0 0)) (= |#memory_int| |old(#memory_int)|) (<= 0 mkdup_~i~0) (or .cse0 (= mkdup_~a.offset 0)) (< mkdup_~i~0 mkdup_~n) (= mkdup_~a.base |mkdup_#in~a.base|) (or .cse0 (<= mkdup_~j~0 mkdup_~i~0)))) [2021-05-06 12:21:05,549 INFO L194 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: (let ((.cse0 (= mkdup_~j~0 mkdup_~i~0)) (.cse1 (<= 0 mkdup_~i~0)) (.cse2 (< mkdup_~i~0 mkdup_~n))) (and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n) (or (and (< 0 mkdup_~j~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) .cse0 (= mkdup_~j~0 0)) (= |#memory_int| |old(#memory_int)|) (or .cse0 (and .cse1 .cse2)) (or (let ((.cse4 (= |mkdup_#in~a.offset| mkdup_~a.offset)) (.cse3 (= mkdup_~a.offset 0))) (and (or (not .cse3) (and (<= (+ mkdup_~i~0 1) mkdup_~n) (or .cse4 (<= mkdup_~j~0 mkdup_~i~0)))) (or .cse4 .cse3))) (and .cse0 .cse1 .cse2)) (or (= (* mkdup_~i~0 4) (* mkdup_~j~0 4)) (= mkdup_~a.base |mkdup_#in~a.base|)))) [2021-05-06 12:21:05,549 INFO L194 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: (let ((.cse2 (= (* mkdup_~i~0 4) (* mkdup_~j~0 4)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (or (let ((.cse0 (= mkdup_~j~0 mkdup_~i~0))) (and (or .cse0 (< mkdup_~i~0 0) (<= mkdup_~n mkdup_~i~0)) (or (not .cse0) (and (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))))) (let ((.cse1 (= |mkdup_#in~a.offset| mkdup_~a.offset))) (and (or .cse1 (not .cse2) (not (= mkdup_~j~0 0))) (or .cse1 (= mkdup_~a.offset 0)) (or .cse1 (<= mkdup_~j~0 mkdup_~i~0))))) (or .cse2 (= mkdup_~a.base |mkdup_#in~a.base|)))) [2021-05-06 12:21:05,549 INFO L194 CegarLoopUtils]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse0 (= mkdup_~j~0 mkdup_~i~0)) (.cse1 (<= 0 mkdup_~i~0)) (.cse2 (< mkdup_~i~0 mkdup_~n))) (and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (or .cse0 (and .cse1 .cse2)) (or (let ((.cse4 (= |mkdup_#in~a.offset| mkdup_~a.offset)) (.cse3 (= mkdup_~a.offset 0))) (and (or (not .cse3) (and (<= (+ mkdup_~i~0 1) mkdup_~n) (or .cse4 (<= mkdup_~j~0 mkdup_~i~0)))) (or .cse4 .cse3))) (and .cse0 .cse1 .cse2)) (or (= (* mkdup_~i~0 4) (* mkdup_~j~0 4)) (= mkdup_~a.base |mkdup_#in~a.base|)))) [2021-05-06 12:21:05,549 INFO L194 CegarLoopUtils]: At program point mkdupEXIT(lines 19 31) the Hoare annotation is: (let ((.cse7 (select |old(#memory_int)| |mkdup_#in~a.base|)) (.cse5 (select |#memory_int| |mkdup_#in~a.base|))) (let ((.cse11 (@diff .cse7 .cse5))) (let ((.cse0 (= mkdup_~j~0 0)) (.cse2 (= |mkdup_#in~a.offset| mkdup_~a.offset)) (.cse3 (= mkdup_~a.offset 0)) (.cse6 (select .cse5 .cse11))) (and (or (let ((.cse1 (= mkdup_~a.base |mkdup_#in~a.base|))) (and (or (not .cse0) .cse1) (or (and .cse2 (or (not (= (+ (* mkdup_~i~0 4) mkdup_~a.offset) 0)) .cse1)) (<= mkdup_~j~0 mkdup_~i~0)))) (not .cse3)) (not (= mkdup_~j~0 mkdup_~i~0)) (= |mkdup_#in~n| mkdup_~n) (or (and (< 0 mkdup_~j~0) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) .cse0) (or (not (let ((.cse4 ((as const (Array Int Int)) 0))) (= .cse4 (store .cse5 (@diff .cse5 .cse4) 0)))) (= .cse6 0) (= .cse7 .cse5)) (<= 0 mkdup_~i~0) (or (= (select .cse5 4) (select .cse5 0)) (not (= |mkdup_#in~a.offset| 0)) (< 8 (* 4 |mkdup_#in~n|))) (or .cse2 .cse3) (< mkdup_~i~0 mkdup_~n) (let ((.cse8 (store .cse7 .cse11 .cse6))) (or (= .cse8 .cse5) (let ((.cse10 (@diff .cse8 .cse5))) (let ((.cse9 (select .cse5 .cse10))) (and (= .cse9 .cse6) (= (store (store .cse7 .cse10 .cse9) .cse11 .cse6) .cse5)))))))))) [2021-05-06 12:21:05,549 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 12:21:05,549 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 12:21:05,549 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 12:21:05,549 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 12:21:05,549 INFO L194 CegarLoopUtils]: At program point L16(line 16) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2021-05-06 12:21:05,549 INFO L194 CegarLoopUtils]: At program point L16-2(lines 15 17) the Hoare annotation is: (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0))) [2021-05-06 12:21:05,549 INFO L201 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2021-05-06 12:21:05,549 INFO L194 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 15 17) the Hoare annotation is: (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0))) [2021-05-06 12:21:05,550 INFO L194 CegarLoopUtils]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (<= (+ .cse0 1) .cse1) (<= 2 main_~n~0) (not (= |main_#t~mem25| |main_#t~mem24|)) (= (select |#valid| |main_#t~malloc16.base|) 1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* .cse0 4)) (select .cse2 (* .cse1 4)))) (= |main_#t~malloc16.offset| 0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2021-05-06 12:21:05,550 INFO L194 CegarLoopUtils]: At program point L62-1(line 62) the Hoare annotation is: (let ((.cse8 (select |#memory_int| main_~a~0.base)) (.cse4 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse1 (= (select |#valid| main_~a~0.base) 1)) (.cse2 (= main_~a~0.offset 0)) (.cse5 (<= 2 main_~n~0)) (.cse3 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse6 (not (= |main_#t~mem25| |main_#t~mem24|))) (.cse7 (= (select |#valid| |main_#t~malloc16.base|) 1)) (.cse10 (= |main_#t~malloc16.offset| 0)) (.cse11 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse12 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse13 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse14 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse9 (select .cse8 (* .cse4 4)))) (or (and .cse0 .cse1 .cse2 (<= (+ .cse3 1) .cse4) .cse5 .cse6 .cse7 (= (select .cse8 (* .cse3 4)) .cse9) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse5 (= .cse3 0) .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 (= (select .cse8 0) .cse9))))) [2021-05-06 12:21:05,550 INFO L194 CegarLoopUtils]: At program point L60(line 60) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (= (select |#valid| |main_#t~malloc16.base|) 1) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (let ((.cse0 (select |#memory_int| main_~a~0.base))) (= (select .cse0 (* .cse1 4)) (select .cse0 (* .cse2 4)))) (let ((.cse3 (= |main_#t~malloc16.offset| 0)) (.cse4 (= main_~a~0.offset 0)) (.cse5 (<= (+ .cse2 1) main_~n~0))) (or (and .cse3 .cse4 (= .cse1 0) .cse5 |main_#t~short20|) (and (<= 1 .cse1) .cse3 .cse4 .cse5 |main_#t~short20|))) (<= (+ .cse1 1) .cse2) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2021-05-06 12:21:05,550 INFO L194 CegarLoopUtils]: At program point L60-2(line 60) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (<= (+ .cse0 1) .cse1) (<= 1 .cse1) (= (select |#valid| |main_#t~malloc16.base|) 1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* .cse0 4)) (select .cse2 (* .cse1 4)))) (= |main_#t~malloc16.offset| 0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (<= (+ .cse1 1) main_~n~0) |main_#t~short20| (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2021-05-06 12:21:05,550 INFO L194 CegarLoopUtils]: At program point L60-3(line 60) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (<= (+ .cse0 1) .cse1) (<= 1 .cse1) (= (select |#valid| |main_#t~malloc16.base|) 1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* .cse0 4)) (select .cse2 (* .cse1 4)))) (= |main_#t~malloc16.offset| 0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (<= (+ .cse1 1) main_~n~0) |main_#t~short20| (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2021-05-06 12:21:05,550 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 48 66) the Hoare annotation is: true [2021-05-06 12:21:05,550 INFO L194 CegarLoopUtils]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#valid| |main_#t~malloc16.base|) 1) (= (select |#valid| main_~a~0.base) 1) (= |main_#t~malloc16.offset| 0) (= main_~a~0.offset 0) (= .cse0 (select |#memory_int| |main_#t~malloc16.base|)) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|))) [2021-05-06 12:21:05,550 INFO L194 CegarLoopUtils]: At program point L54-1(line 54) the Hoare annotation is: (let ((.cse3 (select |#memory_int| main_~a~0.base)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse3 .cse2))) (let ((.cse0 (store .cse3 .cse4 0))) (let ((.cse1 (@diff .cse0 .cse2))) (and (= (store .cse0 .cse1 0) .cse2) (= (select |#valid| |main_#t~malloc16.base|) 1) (= (select |#valid| main_~a~0.base) 1) (or (= (select .cse3 .cse4) (select .cse3 .cse1)) (= .cse0 .cse2)) (= |main_#t~malloc16.offset| 0) (= main_~a~0.offset 0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (or (and (= (select .cse3 (+ (* main_~n~0 4) (- 4))) (select .cse3 0)) (<= 8 (* 4 main_~n~0))) (<= 3 main_~n~0)) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)))))) [2021-05-06 12:21:05,550 INFO L194 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: (and (= (select |#valid| |main_#t~malloc16.base|) 1) (= |main_#t~malloc16.offset| 0) (= |#memory_int| |old(#memory_int)|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) [2021-05-06 12:21:05,550 INFO L194 CegarLoopUtils]: At program point L52-1(line 52) the Hoare annotation is: (and (= (select |#valid| |main_#t~malloc16.base|) 1) (= |main_#t~malloc16.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc16.base|)) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) [2021-05-06 12:21:05,550 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 48 66) the Hoare annotation is: true [2021-05-06 12:21:05,551 INFO L194 CegarLoopUtils]: At program point L63(line 63) the Hoare annotation is: (let ((.cse8 (select |#memory_int| main_~a~0.base)) (.cse4 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse1 (= (select |#valid| main_~a~0.base) 1)) (.cse2 (= main_~a~0.offset 0)) (.cse5 (<= 2 main_~n~0)) (.cse3 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse6 (= |main_#t~mem29| |main_#t~mem28|)) (.cse7 (= (select |#valid| |main_#t~malloc16.base|) 1)) (.cse10 (= |main_#t~malloc16.offset| 0)) (.cse11 (<= (+ main_~a~0.base 1) |#StackHeapBarrier|)) (.cse12 (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|)) (.cse13 (not (= main_~a~0.base |main_~#j~2.base|))) (.cse14 (not (= |main_~#i~2.base| |main_~#j~2.base|))) (.cse9 (select .cse8 (* .cse4 4)))) (or (and .cse0 .cse1 .cse2 (<= (+ .cse3 1) .cse4) .cse5 .cse6 .cse7 (= (select .cse8 (* .cse3 4)) .cse9) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse5 (= .cse3 0) .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 (= (select .cse8 0) .cse9))))) [2021-05-06 12:21:05,551 INFO L201 CegarLoopUtils]: At program point L63-1(line 63) the Hoare annotation is: true [2021-05-06 12:21:05,551 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 48 66) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-05-06 12:21:05,551 INFO L194 CegarLoopUtils]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (<= (+ .cse0 1) .cse1) (<= 1 .cse1) (= (select |#valid| |main_#t~malloc16.base|) 1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* .cse0 4)) (select .cse2 (* .cse1 4)))) (= |main_#t~malloc16.offset| 0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (<= (+ .cse1 1) main_~n~0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short23|)) [2021-05-06 12:21:05,551 INFO L194 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse6 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (let ((.cse0 (= main_~r~0 1)) (.cse1 (= |main_#t~malloc16.offset| 0)) (.cse2 (= main_~a~0.offset 0)) (.cse4 (<= (+ .cse6 1) main_~n~0)) (.cse5 (not (= |main_~#i~2.base| |main_~#j~2.base|)))) (or (and .cse0 .cse1 .cse2 (= .cse3 0) .cse4 .cse5) (and .cse0 (<= 1 .cse3) .cse1 .cse2 .cse4 .cse5))) (= (select |#valid| |main_#t~malloc16.base|) 1) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (let ((.cse7 (select |#memory_int| main_~a~0.base))) (= (select .cse7 (* .cse3 4)) (select .cse7 (* .cse6 4)))) (<= (+ .cse3 1) .cse6) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)))) [2021-05-06 12:21:05,551 INFO L194 CegarLoopUtils]: At program point L61-2(line 61) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (= main_~a~0.offset 0) (<= (+ .cse0 1) .cse1) (<= 2 main_~n~0) (= (select |#valid| |main_#t~malloc16.base|) 1) (let ((.cse2 (select |#memory_int| main_~a~0.base))) (= (select .cse2 (* .cse0 4)) (select .cse2 (* .cse1 4)))) (= |main_#t~malloc16.offset| 0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (<= (+ .cse1 1) main_~n~0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)) |main_#t~short23|)) [2021-05-06 12:21:05,551 INFO L194 CegarLoopUtils]: At program point L59-1(line 59) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (= (select |#valid| |main_#t~malloc16.base|) 1) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (let ((.cse0 (select |#memory_int| main_~a~0.base))) (= (select .cse0 (* .cse1 4)) (select .cse0 (* .cse2 4)))) (= |main_#t~malloc16.offset| 0) (= main_~a~0.offset 0) (<= (+ .cse1 1) .cse2) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)) (let ((.cse3 (<= (+ .cse2 1) main_~n~0))) (or (and (= .cse1 0) .cse3) (and (<= 1 .cse1) .cse3))))) [2021-05-06 12:21:05,551 INFO L194 CegarLoopUtils]: At program point L61-3(line 61) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (= (select |#valid| |main_#t~malloc16.base|) 1) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (let ((.cse0 (select |#memory_int| main_~a~0.base))) (= (select .cse0 (* .cse1 4)) (select .cse0 (* .cse2 4)))) (= |main_#t~malloc16.offset| 0) (= main_~a~0.offset 0) (<= (+ .cse1 1) .cse2) (<= 2 main_~n~0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2021-05-06 12:21:05,551 INFO L194 CegarLoopUtils]: At program point L57(line 57) the Hoare annotation is: (let ((.cse3 (select |#memory_int| main_~a~0.base)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse3 .cse2))) (let ((.cse0 (store .cse3 .cse4 0))) (let ((.cse1 (@diff .cse0 .cse2))) (and (= (store .cse0 .cse1 0) .cse2) (= (select |#valid| |main_#t~malloc16.base|) 1) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (or (= (select .cse3 .cse4) (select .cse3 .cse1)) (= .cse0 .cse2)) (= main_~a~0.offset 0) (= |main_#t~malloc16.offset| 0) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (or (and (= (select .cse3 (+ (* main_~n~0 4) (- 4))) (select .cse3 0)) (<= 8 (* 4 main_~n~0))) (<= 3 main_~n~0)) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|))))))) [2021-05-06 12:21:05,551 INFO L194 CegarLoopUtils]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (and (= (select |#valid| |main_#t~malloc16.base|) 1) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select |#valid| main_~a~0.base) 1) (let ((.cse0 (select |#memory_int| main_~a~0.base))) (= (select .cse0 (* .cse1 4)) (select .cse0 (* .cse2 4)))) (let ((.cse3 (= |main_#t~ret17| 1)) (.cse4 (<= (+ .cse2 1) main_~n~0))) (or (and .cse3 (<= 1 .cse1) .cse4) (and .cse3 (= .cse1 0) .cse4))) (= |main_#t~malloc16.offset| 0) (= main_~a~0.offset 0) (<= (+ .cse1 1) .cse2) (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (<= (+ |main_#t~malloc16.base| 1) |#StackHeapBarrier|) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point L51(line 51) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point L51-1(line 51) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-05-06 12:21:05,552 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 9 11) the Hoare annotation is: true [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point L10(line 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point L10-1(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point L10-3(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-05-06 12:21:05,552 INFO L194 CegarLoopUtils]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-05-06 12:21:05,557 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:559) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-05-06 12:21:05,559 INFO L168 Benchmark]: Toolchain (without parser) took 36472.02 ms. Allocated memory was 167.8 MB in the beginning and 588.3 MB in the end (delta: 420.5 MB). Free memory was 131.8 MB in the beginning and 388.5 MB in the end (delta: -256.7 MB). Peak memory consumption was 336.2 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:05,559 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 167.8 MB. Free memory is still 148.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 12:21:05,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.89 ms. Allocated memory is still 167.8 MB. Free memory was 131.7 MB in the beginning and 149.5 MB in the end (delta: -17.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:05,559 INFO L168 Benchmark]: Boogie Preprocessor took 39.45 ms. Allocated memory is still 167.8 MB. Free memory was 149.5 MB in the beginning and 147.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:05,559 INFO L168 Benchmark]: RCFGBuilder took 358.01 ms. Allocated memory is still 167.8 MB. Free memory was 147.8 MB in the beginning and 124.7 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:05,559 INFO L168 Benchmark]: TraceAbstraction took 35812.87 ms. Allocated memory was 167.8 MB in the beginning and 588.3 MB in the end (delta: 420.5 MB). Free memory was 124.3 MB in the beginning and 388.5 MB in the end (delta: -264.2 MB). Peak memory consumption was 328.7 MB. Max. memory is 8.0 GB. [2021-05-06 12:21:05,560 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.09 ms. Allocated memory is still 167.8 MB. Free memory is still 148.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 257.89 ms. Allocated memory is still 167.8 MB. Free memory was 131.7 MB in the beginning and 149.5 MB in the end (delta: -17.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.45 ms. Allocated memory is still 167.8 MB. Free memory was 149.5 MB in the beginning and 147.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 358.01 ms. Allocated memory is still 167.8 MB. Free memory was 147.8 MB in the beginning and 124.7 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 35812.87 ms. Allocated memory was 167.8 MB in the beginning and 588.3 MB in the end (delta: 420.5 MB). Free memory was 124.3 MB in the beginning and 388.5 MB in the end (delta: -264.2 MB). Peak memory consumption was 328.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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 9 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24696.6ms, OverallIterations: 17, TraceHistogramMax: 5, EmptinessCheckTime: 17.9ms, AutomataDifference: 17832.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 11073.3ms, InitialAbstractionConstructionTime: 6.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 788 SDtfs, 1364 SDslu, 2751 SDs, 0 SdLazy, 9227 SolverSat, 1181 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5375.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 15926.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=13, InterpolantAutomatonStates: 276, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 186.1ms AutomataMinimizationTime, 17 MinimizatonAttempts, 105 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 59 LocationsWithAnnotation, 468 PreInvPairs, 652 NumberOfFragments, 8240 HoareAnnotationTreeSize, 468 FomulaSimplifications, 177301 FormulaSimplificationTreeSizeReduction, 805.9ms HoareSimplificationTime, 59 FomulaSimplificationsInter, 24922 FormulaSimplificationTreeSizeReductionInter, 10237.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...