/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-23 22:59:25,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-23 22:59:25,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-23 22:59:25,331 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-23 22:59:25,332 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-23 22:59:25,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-23 22:59:25,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-23 22:59:25,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-23 22:59:25,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-23 22:59:25,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-23 22:59:25,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-23 22:59:25,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-23 22:59:25,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-23 22:59:25,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-23 22:59:25,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-23 22:59:25,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-23 22:59:25,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-23 22:59:25,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-23 22:59:25,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-23 22:59:25,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-23 22:59:25,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-23 22:59:25,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-23 22:59:25,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-23 22:59:25,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-23 22:59:25,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-23 22:59:25,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-23 22:59:25,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-23 22:59:25,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-23 22:59:25,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-23 22:59:25,418 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-23 22:59:25,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-23 22:59:25,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-23 22:59:25,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-23 22:59:25,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-23 22:59:25,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-23 22:59:25,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-23 22:59:25,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-23 22:59:25,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-23 22:59:25,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-23 22:59:25,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-23 22:59:25,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-23 22:59:25,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-23 22:59:25,456 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-23 22:59:25,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-23 22:59:25,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-23 22:59:25,463 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-23 22:59:25,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-23 22:59:25,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-23 22:59:25,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-23 22:59:25,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-23 22:59:25,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-23 22:59:25,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-23 22:59:25,466 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-23 22:59:25,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-23 22:59:25,467 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-23 22:59:25,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-23 22:59:25,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-23 22:59:25,467 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-23 22:59:25,467 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-23 22:59:25,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-23 22:59:25,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 22:59:25,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-23 22:59:25,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-23 22:59:25,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-23 22:59:25,469 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.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2021-02-23 22:59:25,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-23 22:59:25,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-23 22:59:25,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-23 22:59:25,957 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-23 22:59:25,957 INFO L275 PluginConnector]: CDTParser initialized [2021-02-23 22:59:25,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2021-02-23 22:59:26,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b36ab76e/1c176603356c4f96b819650673a069b1/FLAG81ae10746 [2021-02-23 22:59:26,856 INFO L306 CDTParser]: Found 1 translation units. [2021-02-23 22:59:26,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2021-02-23 22:59:26,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b36ab76e/1c176603356c4f96b819650673a069b1/FLAG81ae10746 [2021-02-23 22:59:27,165 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b36ab76e/1c176603356c4f96b819650673a069b1 [2021-02-23 22:59:27,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-23 22:59:27,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-23 22:59:27,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-23 22:59:27,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-23 22:59:27,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-23 22:59:27,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 10:59:27" (1/1) ... [2021-02-23 22:59:27,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308fca23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27, skipping insertion in model container [2021-02-23 22:59:27,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 10:59:27" (1/1) ... [2021-02-23 22:59:27,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-23 22:59:27,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-23 22:59:27,481 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c[493,506] [2021-02-23 22:59:27,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 22:59:27,530 INFO L203 MainTranslator]: Completed pre-run [2021-02-23 22:59:27,544 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c[493,506] [2021-02-23 22:59:27,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 22:59:27,571 INFO L208 MainTranslator]: Completed translation [2021-02-23 22:59:27,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27 WrapperNode [2021-02-23 22:59:27,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-23 22:59:27,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-23 22:59:27,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-23 22:59:27,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-23 22:59:27,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27" (1/1) ... [2021-02-23 22:59:27,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27" (1/1) ... [2021-02-23 22:59:27,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27" (1/1) ... [2021-02-23 22:59:27,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27" (1/1) ... [2021-02-23 22:59:27,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27" (1/1) ... [2021-02-23 22:59:27,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27" (1/1) ... [2021-02-23 22:59:27,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27" (1/1) ... [2021-02-23 22:59:27,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-23 22:59:27,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-23 22:59:27,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-23 22:59:27,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-23 22:59:27,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27" (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-02-23 22:59:27,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-23 22:59:27,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-23 22:59:27,712 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-23 22:59:27,713 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-23 22:59:27,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-02-23 22:59:27,713 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-02-23 22:59:27,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-23 22:59:27,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-02-23 22:59:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-23 22:59:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-23 22:59:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-23 22:59:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-23 22:59:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-23 22:59:27,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-23 22:59:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-23 22:59:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-23 22:59:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-23 22:59:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-02-23 22:59:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-23 22:59:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-23 22:59:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-23 22:59:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-02-23 22:59:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-23 22:59:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-23 22:59:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-23 22:59:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-23 22:59:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-23 22:59:28,222 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-23 22:59:28,223 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-23 22:59:28,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 10:59:28 BoogieIcfgContainer [2021-02-23 22:59:28,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-23 22:59:28,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-23 22:59:28,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-23 22:59:28,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-23 22:59:28,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 10:59:27" (1/3) ... [2021-02-23 22:59:28,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3f5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 10:59:28, skipping insertion in model container [2021-02-23 22:59:28,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:27" (2/3) ... [2021-02-23 22:59:28,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3f5a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 10:59:28, skipping insertion in model container [2021-02-23 22:59:28,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 10:59:28" (3/3) ... [2021-02-23 22:59:28,235 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2021-02-23 22:59:28,245 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-23 22:59:28,253 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-23 22:59:28,273 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-23 22:59:28,298 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-23 22:59:28,299 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-23 22:59:28,299 INFO L378 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2021-02-23 22:59:28,299 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-23 22:59:28,299 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-23 22:59:28,299 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-23 22:59:28,300 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-23 22:59:28,300 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-23 22:59:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2021-02-23 22:59:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-02-23 22:59:28,327 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:28,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 22:59:28,329 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:28,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2141980220, now seen corresponding path program 1 times [2021-02-23 22:59:28,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:28,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [132445884] [2021-02-23 22:59:28,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:28,673 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,675 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:28,687 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,690 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:28,729 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,733 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:28,762 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,764 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:28,788 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,790 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:28,805 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,807 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:28,819 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,819 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:28,831 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:28,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:28,930 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,931 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:28,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:28,951 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,952 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:28,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 22:59:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:28,994 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:28,994 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 22:59:29,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [132445884] [2021-02-23 22:59:29,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 22:59:29,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-23 22:59:29,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737402061] [2021-02-23 22:59:29,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-23 22:59:29,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:29,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-23 22:59:29,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-02-23 22:59:29,055 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 10 states. [2021-02-23 22:59:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:30,401 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2021-02-23 22:59:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-23 22:59:30,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2021-02-23 22:59:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:30,416 INFO L225 Difference]: With dead ends: 215 [2021-02-23 22:59:30,417 INFO L226 Difference]: Without dead ends: 128 [2021-02-23 22:59:30,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-02-23 22:59:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-02-23 22:59:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2021-02-23 22:59:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-02-23 22:59:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-02-23 22:59:30,509 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 36 [2021-02-23 22:59:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:30,510 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-02-23 22:59:30,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-23 22:59:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-02-23 22:59:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-23 22:59:30,513 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:30,514 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-23 22:59:30,514 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-23 22:59:30,515 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:30,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash 572347764, now seen corresponding path program 1 times [2021-02-23 22:59:30,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:30,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [748347287] [2021-02-23 22:59:30,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,667 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,669 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,671 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,672 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:30,675 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,676 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:30,680 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,681 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:30,689 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,690 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-23 22:59:30,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,707 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 22:59:30,724 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,725 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 22:59:30,737 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,737 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,780 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,787 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,788 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 22:59:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,811 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,812 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:30,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 22:59:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,836 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,837 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 22:59:30,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [748347287] [2021-02-23 22:59:30,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 22:59:30,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-23 22:59:30,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721606977] [2021-02-23 22:59:30,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-23 22:59:30,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:30,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-23 22:59:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-02-23 22:59:30,852 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 11 states. [2021-02-23 22:59:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:31,641 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2021-02-23 22:59:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-23 22:59:31,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2021-02-23 22:59:31,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:31,644 INFO L225 Difference]: With dead ends: 178 [2021-02-23 22:59:31,645 INFO L226 Difference]: Without dead ends: 108 [2021-02-23 22:59:31,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-02-23 22:59:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-02-23 22:59:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-02-23 22:59:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-02-23 22:59:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2021-02-23 22:59:31,677 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 57 [2021-02-23 22:59:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:31,678 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2021-02-23 22:59:31,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-23 22:59:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2021-02-23 22:59:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-23 22:59:31,680 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:31,680 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-23 22:59:31,681 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-23 22:59:31,681 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:31,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2023865644, now seen corresponding path program 1 times [2021-02-23 22:59:31,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:31,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864074765] [2021-02-23 22:59:31,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:31,780 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:31,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,783 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,789 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,790 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,797 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,798 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,805 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,806 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,832 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,849 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,865 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,866 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,882 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,883 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,901 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,901 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:31,903 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,903 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:31,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,916 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:31,930 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,930 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:31,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:31,974 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,975 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:31,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:31,980 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:31,981 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:31,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 22:59:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:32,001 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,001 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:32,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 22:59:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:32,009 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 22:59:32,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864074765] [2021-02-23 22:59:32,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:32,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-02-23 22:59:32,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181217301] [2021-02-23 22:59:32,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-23 22:59:32,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-23 22:59:32,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-02-23 22:59:32,022 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 15 states. [2021-02-23 22:59:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:33,705 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2021-02-23 22:59:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-23 22:59:33,705 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2021-02-23 22:59:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:33,710 INFO L225 Difference]: With dead ends: 174 [2021-02-23 22:59:33,711 INFO L226 Difference]: Without dead ends: 172 [2021-02-23 22:59:33,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2021-02-23 22:59:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-02-23 22:59:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2021-02-23 22:59:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-02-23 22:59:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2021-02-23 22:59:33,760 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 57 [2021-02-23 22:59:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:33,760 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2021-02-23 22:59:33,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-23 22:59:33,761 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2021-02-23 22:59:33,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-23 22:59:33,763 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:33,764 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1] [2021-02-23 22:59:33,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-23 22:59:33,764 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:33,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:33,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1959749596, now seen corresponding path program 1 times [2021-02-23 22:59:33,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:33,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345117182] [2021-02-23 22:59:33,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:33,860 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,861 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:33,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,869 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,870 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,886 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,887 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,897 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,898 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,908 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,909 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,920 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,921 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,934 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,949 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,950 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,964 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,965 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,965 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,966 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,981 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,997 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,998 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:34,015 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,016 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:34,034 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,034 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:34,054 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,055 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:34,055 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,056 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:34,070 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,071 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:34,086 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,087 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:34,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:34,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,134 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:34,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:34,139 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,139 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:34,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 22:59:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:34,161 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,162 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:34,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 22:59:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:34,169 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,170 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:34,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-23 22:59:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:34,176 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:34,177 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-23 22:59:34,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345117182] [2021-02-23 22:59:34,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:34,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-02-23 22:59:34,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792483975] [2021-02-23 22:59:34,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-23 22:59:34,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-23 22:59:34,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-23 22:59:34,216 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 20 states. [2021-02-23 22:59:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:36,795 INFO L93 Difference]: Finished difference Result 238 states and 260 transitions. [2021-02-23 22:59:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-23 22:59:36,796 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-23 22:59:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:36,800 INFO L225 Difference]: With dead ends: 238 [2021-02-23 22:59:36,800 INFO L226 Difference]: Without dead ends: 236 [2021-02-23 22:59:36,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2021-02-23 22:59:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-02-23 22:59:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 198. [2021-02-23 22:59:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-02-23 22:59:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2021-02-23 22:59:36,880 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 78 [2021-02-23 22:59:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:36,881 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2021-02-23 22:59:36,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-23 22:59:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2021-02-23 22:59:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-23 22:59:36,883 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:36,883 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 22:59:36,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-23 22:59:36,884 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:36,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:36,885 INFO L82 PathProgramCache]: Analyzing trace with hash -636463812, now seen corresponding path program 2 times [2021-02-23 22:59:36,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:36,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [372310951] [2021-02-23 22:59:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:37,023 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,024 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:37,025 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,026 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,032 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,033 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,042 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,059 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,060 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,070 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,071 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,085 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,101 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,102 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,117 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,132 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,133 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,151 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,155 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,159 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,163 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,183 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,226 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,226 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,245 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,247 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,267 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,268 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:37,269 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:37,282 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,284 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:37,300 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,301 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:37,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:37,354 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,362 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:37,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:37,373 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,374 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:37,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 22:59:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:37,396 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,396 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:37,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 22:59:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:37,402 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,403 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:37,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-23 22:59:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:37,410 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:37,411 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-23 22:59:37,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [372310951] [2021-02-23 22:59:37,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:37,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-02-23 22:59:37,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032416322] [2021-02-23 22:59:37,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-23 22:59:37,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:37,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-23 22:59:37,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-23 22:59:37,429 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 20 states. [2021-02-23 22:59:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:39,975 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2021-02-23 22:59:39,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-23 22:59:39,976 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-23 22:59:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:39,979 INFO L225 Difference]: With dead ends: 281 [2021-02-23 22:59:39,980 INFO L226 Difference]: Without dead ends: 279 [2021-02-23 22:59:39,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2021-02-23 22:59:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-02-23 22:59:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 243. [2021-02-23 22:59:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2021-02-23 22:59:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 264 transitions. [2021-02-23 22:59:40,032 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 264 transitions. Word has length 78 [2021-02-23 22:59:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:40,033 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 264 transitions. [2021-02-23 22:59:40,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-23 22:59:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2021-02-23 22:59:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-02-23 22:59:40,035 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:40,035 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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, 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-02-23 22:59:40,036 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-23 22:59:40,036 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1871950108, now seen corresponding path program 1 times [2021-02-23 22:59:40,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:40,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720033329] [2021-02-23 22:59:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,095 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,096 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:40,099 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:40,103 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,104 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:40,108 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,109 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:40,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,117 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-23 22:59:40,124 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,125 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-23 22:59:40,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 22:59:40,147 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,147 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 22:59:40,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,160 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 22:59:40,173 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,174 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 22:59:40,187 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,188 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:40,199 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,200 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:40,217 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,217 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,260 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,261 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,265 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,266 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 22:59:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,286 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,286 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:40,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 22:59:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,307 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,307 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-02-23 22:59:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,313 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,314 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-02-23 22:59:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-23 22:59:40,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720033329] [2021-02-23 22:59:40,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:40,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-02-23 22:59:40,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363129508] [2021-02-23 22:59:40,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-02-23 22:59:40,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:40,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-02-23 22:59:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-02-23 22:59:40,336 INFO L87 Difference]: Start difference. First operand 243 states and 264 transitions. Second operand 16 states. [2021-02-23 22:59:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:41,664 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2021-02-23 22:59:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-23 22:59:41,664 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2021-02-23 22:59:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:41,667 INFO L225 Difference]: With dead ends: 257 [2021-02-23 22:59:41,667 INFO L226 Difference]: Without dead ends: 157 [2021-02-23 22:59:41,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-02-23 22:59:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-02-23 22:59:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2021-02-23 22:59:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-02-23 22:59:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2021-02-23 22:59:41,697 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 77 [2021-02-23 22:59:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:41,697 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2021-02-23 22:59:41,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-02-23 22:59:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2021-02-23 22:59:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-23 22:59:41,699 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:41,699 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-02-23 22:59:41,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-23 22:59:41,700 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:41,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:41,701 INFO L82 PathProgramCache]: Analyzing trace with hash -177855180, now seen corresponding path program 2 times [2021-02-23 22:59:41,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:41,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702248291] [2021-02-23 22:59:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:41,773 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,774 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:41,775 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,776 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,781 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,782 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,789 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,789 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,797 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,798 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,807 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,808 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,817 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,818 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,830 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,831 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,848 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,850 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,864 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,886 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,887 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,888 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,906 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,907 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,925 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,925 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,944 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,945 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,963 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,964 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,984 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,986 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:41,988 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:41,990 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,009 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,010 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,029 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,030 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,052 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,053 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,094 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,122 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,123 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,123 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,124 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:42,145 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,145 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:42,167 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,167 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,221 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,222 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,225 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,226 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 22:59:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,249 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,249 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 22:59:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,258 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,259 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-23 22:59:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,272 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-23 22:59:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,284 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,285 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-23 22:59:42,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1702248291] [2021-02-23 22:59:42,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:42,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-02-23 22:59:42,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460962392] [2021-02-23 22:59:42,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-23 22:59:42,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:42,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-23 22:59:42,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-23 22:59:42,315 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 25 states. [2021-02-23 22:59:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:45,129 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2021-02-23 22:59:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-02-23 22:59:45,135 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-23 22:59:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:45,137 INFO L225 Difference]: With dead ends: 180 [2021-02-23 22:59:45,137 INFO L226 Difference]: Without dead ends: 118 [2021-02-23 22:59:45,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=632, Invalid=3028, Unknown=0, NotChecked=0, Total=3660 [2021-02-23 22:59:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-02-23 22:59:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2021-02-23 22:59:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-02-23 22:59:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2021-02-23 22:59:45,159 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 99 [2021-02-23 22:59:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:45,160 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2021-02-23 22:59:45,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-23 22:59:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2021-02-23 22:59:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-23 22:59:45,161 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:45,161 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-02-23 22:59:45,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-23 22:59:45,162 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash 852518516, now seen corresponding path program 3 times [2021-02-23 22:59:45,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:45,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573739839] [2021-02-23 22:59:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,221 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,221 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,222 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,222 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,227 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,228 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,233 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,234 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,241 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,241 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,249 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,250 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,259 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,260 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,271 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,272 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,284 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,285 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,297 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,297 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,311 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,312 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,313 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,328 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,329 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,345 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,346 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,362 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,363 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,380 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,380 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,406 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,406 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,407 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,407 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,428 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,428 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,448 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,450 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,471 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,495 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,495 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,517 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,517 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,518 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,518 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:45,535 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,535 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:45,554 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,554 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,600 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,601 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,605 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,605 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 22:59:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,628 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,628 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 22:59:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,632 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,633 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-23 22:59:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,637 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,638 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-23 22:59:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,642 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,642 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 33 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-23 22:59:45,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573739839] [2021-02-23 22:59:45,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:45,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-02-23 22:59:45,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965973267] [2021-02-23 22:59:45,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-23 22:59:45,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:45,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-23 22:59:45,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-23 22:59:45,682 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 25 states. [2021-02-23 22:59:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:48,300 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2021-02-23 22:59:48,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-23 22:59:48,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-23 22:59:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:48,303 INFO L225 Difference]: With dead ends: 125 [2021-02-23 22:59:48,303 INFO L226 Difference]: Without dead ends: 0 [2021-02-23 22:59:48,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=569, Invalid=2737, Unknown=0, NotChecked=0, Total=3306 [2021-02-23 22:59:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-23 22:59:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-23 22:59:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-23 22:59:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-23 22:59:48,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-02-23 22:59:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:48,306 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-23 22:59:48,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-23 22:59:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-23 22:59:48,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-23 22:59:48,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-23 22:59:48,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-23 22:59:51,274 WARN L202 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 22:59:51,385 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 29 [2021-02-23 22:59:51,540 WARN L202 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2021-02-23 22:59:51,689 WARN L202 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-23 22:59:51,917 WARN L202 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2021-02-23 22:59:52,099 WARN L202 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-23 22:59:52,314 WARN L202 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2021-02-23 22:59:52,521 WARN L202 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 22:59:52,782 WARN L202 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-02-23 22:59:52,944 WARN L202 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 22:59:53,111 WARN L202 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 22:59:53,342 WARN L202 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2021-02-23 22:59:53,528 WARN L202 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-23 22:59:53,731 WARN L202 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-02-23 22:59:53,891 WARN L202 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 22:59:54,110 WARN L202 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 22:59:54,293 WARN L202 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-23 22:59:54,450 WARN L202 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 22:59:54,685 WARN L202 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2021-02-23 22:59:54,809 WARN L202 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2021-02-23 22:59:54,946 WARN L202 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-23 22:59:55,141 WARN L202 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 22:59:55,367 WARN L202 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2021-02-23 22:59:55,526 WARN L202 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 22:59:55,751 WARN L202 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2021-02-23 22:59:55,968 WARN L202 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-02-23 22:59:56,123 WARN L202 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 22:59:56,345 WARN L202 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2021-02-23 22:59:56,574 WARN L202 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-23 22:59:56,721 WARN L202 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2021-02-23 22:59:56,984 WARN L202 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2021-02-23 22:59:57,171 WARN L202 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 22:59:57,391 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 22:59:57,560 WARN L202 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-23 22:59:57,767 WARN L202 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-23 22:59:57,983 WARN L202 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2021-02-23 22:59:58,225 WARN L202 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 22:59:58,403 WARN L202 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-23 22:59:58,603 WARN L202 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-23 22:59:58,608 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-02-23 22:59:58,608 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-02-23 22:59:58,608 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-02-23 22:59:58,608 INFO L192 CegarLoopUtils]: At program point L5-4(line 5) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L185 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-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point L5(line 5) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point L5-1(line 5) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point L5-2(line 5) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point L5-3(line 5) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 22:59:58,609 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L192 CegarLoopUtils]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 41 50) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 22:59:58,610 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 41 50) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L192 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L192 CegarLoopUtils]: At program point L48-1(line 48) the Hoare annotation is: true [2021-02-23 22:59:58,610 INFO L185 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-23 22:59:58,610 INFO L185 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-23 22:59:58,611 INFO L192 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: true [2021-02-23 22:59:58,611 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 41 50) the Hoare annotation is: true [2021-02-23 22:59:58,611 INFO L185 CegarLoopUtils]: At program point L44(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 22:59:58,611 INFO L185 CegarLoopUtils]: At program point L45-1(line 45) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc17.base|)) [2021-02-23 22:59:58,611 INFO L192 CegarLoopUtils]: At program point L46-2(line 46) the Hoare annotation is: true [2021-02-23 22:59:58,611 INFO L185 CegarLoopUtils]: At program point L44-1(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 22:59:58,611 INFO L192 CegarLoopUtils]: At program point L46-3(line 46) the Hoare annotation is: true [2021-02-23 22:59:58,611 INFO L185 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 22:59:58,611 INFO L185 CegarLoopUtils]: At program point L42-1(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 22:59:58,612 INFO L185 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,612 INFO L185 CegarLoopUtils]: At program point L35-2(line 35) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse8))) (.cse2 (= check_~ax~0 0)) (.cse3 (= |check_#t~mem15| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse8)) (.cse6 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse7 (+ check_~y 1))) (and .cse2 .cse3 (<= .cse7 |check_#in~n|) .cse4 (<= .cse7 check_~n) .cse5 .cse6)))))) [2021-02-23 22:59:58,612 INFO L185 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,612 INFO L192 CegarLoopUtils]: At program point checkENTRY(lines 16 39) the Hoare annotation is: true [2021-02-23 22:59:58,613 INFO L185 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,613 INFO L185 CegarLoopUtils]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 .cse4 (= check_~x 0))) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-23 22:59:58,613 INFO L185 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,613 INFO L185 CegarLoopUtils]: At program point L25-2(lines 25 26) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 (= |check_#t~mem9| 0) .cse4 (= check_~x 0)))))) [2021-02-23 22:59:58,613 INFO L185 CegarLoopUtils]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 (= |check_#t~mem9| 0) .cse4 (= check_~x 0)))))) [2021-02-23 22:59:58,614 INFO L185 CegarLoopUtils]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 .cse4 (= check_~x 0))) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-23 22:59:58,614 INFO L185 CegarLoopUtils]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,614 INFO L185 CegarLoopUtils]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (= |check_#t~post10| 0) .cse4 (= check_~x 0))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 .cse5 .cse1 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 1 check_~x)))))) [2021-02-23 22:59:58,614 INFO L185 CegarLoopUtils]: At program point L25-7(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (= |check_#t~post10| 0) .cse4 (<= 1 check_~x))) (or .cse0 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 2 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-23 22:59:58,614 INFO L185 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,615 INFO L185 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse2 (<= .cse7 |check_#in~n|)) (.cse3 (<= .cse7 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 (= (select |#memory_int| check_~a.base) .cse4) (<= 1 check_~x)) .cse5 .cse1) (or (and .cse2 .cse3 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-23 22:59:58,615 INFO L185 CegarLoopUtils]: At program point L25-9(line 25) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,615 INFO L185 CegarLoopUtils]: At program point L25-10(line 25) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,615 INFO L185 CegarLoopUtils]: At program point L25-11(lines 25 26) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse10 |check_#in~n|)) (.cse4 (<= .cse10 check_~n)) (.cse2 (<= 2 check_~x)) (.cse5 (= (select |#memory_int| check_~a.base) .cse9)) (.cse6 (<= 1 check_~x)) (.cse7 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse8 (<= (+ check_~y 2) check_~n))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 .cse6) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 .cse5 .cse2) .cse7 .cse1 (and .cse8 .cse5 .cse6)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse7 .cse1 .cse8)))) [2021-02-23 22:59:58,615 INFO L185 CegarLoopUtils]: At program point checkFINAL(lines 16 39) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,615 INFO L185 CegarLoopUtils]: At program point L36(line 36) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse2 (= check_~ax~0 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (<= 1 check_~x)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 .cse5) .cse1) (or (let ((.cse6 (+ check_~y 1))) (and .cse2 (<= .cse6 |check_#in~n|) .cse3 (<= .cse6 check_~n) .cse4 .cse5)) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,616 INFO L185 CegarLoopUtils]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) .cse1)))) [2021-02-23 22:59:58,616 INFO L185 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6))) (.cse2 (= |check_#t~mem14| 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse5 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (let ((.cse3 (+ check_~y 1))) (and .cse2 (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) .cse4 .cse5)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4 .cse5))))) [2021-02-23 22:59:58,616 INFO L185 CegarLoopUtils]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (= |check_#t~mem14| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse6 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse3 (+ check_~y 1))) (and .cse2 (<= .cse3 |check_#in~n|) .cse4 (<= .cse3 check_~n) .cse5 .cse6)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4 .cse5 .cse6))))) [2021-02-23 22:59:58,616 INFO L185 CegarLoopUtils]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,616 INFO L185 CegarLoopUtils]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,616 INFO L185 CegarLoopUtils]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,617 INFO L185 CegarLoopUtils]: At program point L28(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,617 INFO L185 CegarLoopUtils]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,617 INFO L185 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,617 INFO L185 CegarLoopUtils]: At program point L28-2(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,617 INFO L185 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 .cse2 .cse1 (let ((.cse4 (+ check_~y 1))) (and (<= (+ |check_#t~post11| 1) check_~n) (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (= (select |#memory_int| check_~a.base) .cse5) (<= 1 check_~x))))))) [2021-02-23 22:59:58,617 INFO L185 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and (<= (+ |check_#t~post11| 1) check_~n) (<= (+ check_~y 2) check_~n) (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)))))) [2021-02-23 22:59:58,618 INFO L185 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,618 INFO L185 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,618 INFO L185 CegarLoopUtils]: At program point checkEXIT(lines 16 39) the Hoare annotation is: (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 22:59:58,618 INFO L185 CegarLoopUtils]: At program point L16(lines 16 39) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2021-02-23 22:59:58,618 INFO L185 CegarLoopUtils]: At program point L16-1(lines 16 39) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 (<= 1 check_~x)) .cse3 .cse1) (or .cse0 (and .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse3 .cse1 (<= (+ check_~y 2) |check_#in~n|)))) [2021-02-23 22:59:58,618 INFO L185 CegarLoopUtils]: At program point L16-2(lines 16 39) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse2 .cse3 (<= 1 check_~x)) .cse4 .cse1)))) [2021-02-23 22:59:58,619 INFO L185 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) .cse2 (<= .cse5 check_~n) .cse3 .cse4)))))) [2021-02-23 22:59:58,619 INFO L185 CegarLoopUtils]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem15| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse0 (let ((.cse6 (+ check_~y 1))) (and .cse2 (<= .cse6 |check_#in~n|) .cse3 (<= .cse6 check_~n) .cse4 .cse5)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 22:59:58,619 INFO L192 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2021-02-23 22:59:58,619 INFO L185 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-23 22:59:58,619 INFO L185 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-23 22:59:58,619 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-23 22:59:58,619 INFO L185 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-23 22:59:58,619 INFO L185 CegarLoopUtils]: At program point L11-4(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-23 22:59:58,620 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-23 22:59:58,620 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-23 22:59:58,620 INFO L185 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-02-23 22:59:58,620 INFO L185 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-02-23 22:59:58,637 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.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.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) 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:558) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) 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-02-23 22:59:58,640 INFO L168 Benchmark]: Toolchain (without parser) took 31468.58 ms. Allocated memory was 153.1 MB in the beginning and 429.9 MB in the end (delta: 276.8 MB). Free memory was 129.2 MB in the beginning and 394.1 MB in the end (delta: -264.9 MB). Peak memory consumption was 253.1 MB. Max. memory is 8.0 GB. [2021-02-23 22:59:58,641 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 153.1 MB. Free memory was 126.9 MB in the beginning and 126.7 MB in the end (delta: 146.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-02-23 22:59:58,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.55 ms. Allocated memory is still 153.1 MB. Free memory was 128.2 MB in the beginning and 118.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-23 22:59:58,641 INFO L168 Benchmark]: Boogie Preprocessor took 39.88 ms. Allocated memory is still 153.1 MB. Free memory was 118.0 MB in the beginning and 116.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-23 22:59:58,642 INFO L168 Benchmark]: RCFGBuilder took 610.40 ms. Allocated memory is still 153.1 MB. Free memory was 116.4 MB in the beginning and 126.7 MB in the end (delta: -10.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-02-23 22:59:58,642 INFO L168 Benchmark]: TraceAbstraction took 30412.61 ms. Allocated memory was 153.1 MB in the beginning and 429.9 MB in the end (delta: 276.8 MB). Free memory was 125.8 MB in the beginning and 394.1 MB in the end (delta: -268.3 MB). Peak memory consumption was 249.2 MB. Max. memory is 8.0 GB. [2021-02-23 22:59:58,643 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.23 ms. Allocated memory is still 153.1 MB. Free memory was 126.9 MB in the beginning and 126.7 MB in the end (delta: 146.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 377.55 ms. Allocated memory is still 153.1 MB. Free memory was 128.2 MB in the beginning and 118.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 39.88 ms. Allocated memory is still 153.1 MB. Free memory was 118.0 MB in the beginning and 116.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 610.40 ms. Allocated memory is still 153.1 MB. Free memory was 116.4 MB in the beginning and 126.7 MB in the end (delta: -10.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 30412.61 ms. Allocated memory was 153.1 MB in the beginning and 429.9 MB in the end (delta: 276.8 MB). Free memory was 125.8 MB in the beginning and 394.1 MB in the end (delta: -268.3 MB). Peak memory consumption was 249.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 41]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 10]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - 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...