/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.0-b8ad66e [2020-10-24 00:57:37,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:57:37,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:57:37,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:57:37,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:57:37,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:57:37,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:57:37,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:57:37,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:57:37,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:57:37,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:57:37,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:57:37,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:57:37,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:57:37,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:57:37,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:57:37,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:57:37,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:57:37,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:57:37,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:57:37,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:57:37,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:57:37,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:57:37,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:57:37,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:57:37,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:57:37,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:57:37,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:57:37,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:57:37,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:57:37,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:57:37,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:57:37,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:57:37,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:57:37,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:57:37,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:57:37,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:57:37,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:57:37,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:57:37,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:57:37,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:57:37,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:57:37,336 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:57:37,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:57:37,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:57:37,341 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:57:37,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:57:37,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:57:37,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:57:37,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:57:37,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:57:37,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:57:37,344 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:57:37,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:57:37,345 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:57:37,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:57:37,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:57:37,346 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:57:37,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:57:37,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:57:37,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:57:37,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:57:37,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:57:37,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:57:37,348 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 [2020-10-24 00:57:37,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:57:37,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:57:37,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:57:37,800 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:57:37,800 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:57:37,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-10-24 00:57:37,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1e52996/e234bac9322946898e02091eec9ed126/FLAG30a022446 [2020-10-24 00:57:38,557 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:57:38,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-10-24 00:57:38,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1e52996/e234bac9322946898e02091eec9ed126/FLAG30a022446 [2020-10-24 00:57:38,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d1e52996/e234bac9322946898e02091eec9ed126 [2020-10-24 00:57:38,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:57:38,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:57:38,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:57:38,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:57:38,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:57:38,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:38" (1/1) ... [2020-10-24 00:57:38,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf859b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:38, skipping insertion in model container [2020-10-24 00:57:38,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:38" (1/1) ... [2020-10-24 00:57:38,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:57:38,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:57:39,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:57:39,151 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:57:39,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:57:39,197 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:57:39,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39 WrapperNode [2020-10-24 00:57:39,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:57:39,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:57:39,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:57:39,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:57:39,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39" (1/1) ... [2020-10-24 00:57:39,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39" (1/1) ... [2020-10-24 00:57:39,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39" (1/1) ... [2020-10-24 00:57:39,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39" (1/1) ... [2020-10-24 00:57:39,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39" (1/1) ... [2020-10-24 00:57:39,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39" (1/1) ... [2020-10-24 00:57:39,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39" (1/1) ... [2020-10-24 00:57:39,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:57:39,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:57:39,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:57:39,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:57:39,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39" (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 [2020-10-24 00:57:39,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:57:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:57:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:57:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-24 00:57:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 00:57:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-10-24 00:57:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:57:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-10-24 00:57:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-24 00:57:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-24 00:57:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:57:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:57:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:57:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:57:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-24 00:57:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 00:57:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:57:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-10-24 00:57:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:57:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:57:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-24 00:57:39,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-10-24 00:57:39,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:57:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:57:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:57:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:57:39,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:57:39,916 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:57:39,916 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:57:39,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:39 BoogieIcfgContainer [2020-10-24 00:57:39,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:57:39,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:57:39,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:57:39,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:57:39,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:57:38" (1/3) ... [2020-10-24 00:57:39,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4567147c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:39, skipping insertion in model container [2020-10-24 00:57:39,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:39" (2/3) ... [2020-10-24 00:57:39,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4567147c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:39, skipping insertion in model container [2020-10-24 00:57:39,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:39" (3/3) ... [2020-10-24 00:57:39,928 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-10-24 00:57:39,940 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:57:39,946 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:57:39,960 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:57:39,987 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:57:39,987 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:57:39,988 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:57:39,988 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:57:39,988 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:57:39,988 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:57:39,988 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:57:39,989 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:57:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-10-24 00:57:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-24 00:57:40,020 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:40,021 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, 1] [2020-10-24 00:57:40,021 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:40,029 INFO L82 PathProgramCache]: Analyzing trace with hash -814113911, now seen corresponding path program 1 times [2020-10-24 00:57:40,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:40,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [740956381] [2020-10-24 00:57:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:40,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:40,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:40,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-24 00:57:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:57:40,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [740956381] [2020-10-24 00:57:40,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:57:40,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-24 00:57:40,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411662741] [2020-10-24 00:57:40,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:57:40,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:40,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:57:40,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:57:40,540 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-10-24 00:57:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:41,797 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2020-10-24 00:57:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:57:41,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2020-10-24 00:57:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:41,810 INFO L225 Difference]: With dead ends: 219 [2020-10-24 00:57:41,810 INFO L226 Difference]: Without dead ends: 129 [2020-10-24 00:57:41,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:57:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-24 00:57:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2020-10-24 00:57:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-24 00:57:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2020-10-24 00:57:41,914 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 37 [2020-10-24 00:57:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:41,915 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2020-10-24 00:57:41,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:57:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2020-10-24 00:57:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-24 00:57:41,919 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:41,920 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, 1] [2020-10-24 00:57:41,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:57:41,920 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:41,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1540266705, now seen corresponding path program 1 times [2020-10-24 00:57:41,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:41,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [413057948] [2020-10-24 00:57:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:42,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:42,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:42,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-24 00:57:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:42,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:57:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:57:42,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [413057948] [2020-10-24 00:57:42,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:57:42,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-24 00:57:42,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476637662] [2020-10-24 00:57:42,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:57:42,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:57:42,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:57:42,227 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 11 states. [2020-10-24 00:57:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:42,988 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2020-10-24 00:57:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:57:42,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2020-10-24 00:57:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:42,991 INFO L225 Difference]: With dead ends: 175 [2020-10-24 00:57:42,991 INFO L226 Difference]: Without dead ends: 104 [2020-10-24 00:57:42,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:57:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-24 00:57:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-24 00:57:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-24 00:57:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2020-10-24 00:57:43,024 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 58 [2020-10-24 00:57:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:43,025 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2020-10-24 00:57:43,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:57:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2020-10-24 00:57:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-24 00:57:43,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:43,027 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, 1] [2020-10-24 00:57:43,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:57:43,027 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:43,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1632937615, now seen corresponding path program 1 times [2020-10-24 00:57:43,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:43,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [282425848] [2020-10-24 00:57:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:43,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:43,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:43,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-24 00:57:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:43,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:57:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:57:43,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [282425848] [2020-10-24 00:57:43,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:43,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:57:43,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733420680] [2020-10-24 00:57:43,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:57:43,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:43,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:57:43,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:57:43,538 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 15 states. [2020-10-24 00:57:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:45,348 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2020-10-24 00:57:45,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:57:45,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2020-10-24 00:57:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:45,354 INFO L225 Difference]: With dead ends: 148 [2020-10-24 00:57:45,355 INFO L226 Difference]: Without dead ends: 145 [2020-10-24 00:57:45,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-10-24 00:57:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-24 00:57:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2020-10-24 00:57:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-10-24 00:57:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2020-10-24 00:57:45,413 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 58 [2020-10-24 00:57:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:45,417 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2020-10-24 00:57:45,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:57:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2020-10-24 00:57:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 00:57:45,430 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:45,431 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, 1] [2020-10-24 00:57:45,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:57:45,432 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:45,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash -396077462, now seen corresponding path program 1 times [2020-10-24 00:57:45,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:45,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296232522] [2020-10-24 00:57:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-24 00:57:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:57:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-10-24 00:57:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2020-10-24 00:57:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:57:45,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296232522] [2020-10-24 00:57:45,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:45,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:57:45,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919380687] [2020-10-24 00:57:45,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:57:45,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:45,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:57:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:57:45,723 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 15 states. [2020-10-24 00:57:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:46,979 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2020-10-24 00:57:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:57:46,980 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 78 [2020-10-24 00:57:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:46,984 INFO L225 Difference]: With dead ends: 154 [2020-10-24 00:57:46,984 INFO L226 Difference]: Without dead ends: 93 [2020-10-24 00:57:46,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:57:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-24 00:57:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2020-10-24 00:57:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-24 00:57:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2020-10-24 00:57:47,024 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2020-10-24 00:57:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:47,025 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2020-10-24 00:57:47,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:57:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2020-10-24 00:57:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 00:57:47,030 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:57:47,030 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, 1] [2020-10-24 00:57:47,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:57:47,031 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:57:47,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:57:47,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1944920951, now seen corresponding path program 2 times [2020-10-24 00:57:47,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:57:47,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1970191791] [2020-10-24 00:57:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:57:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:47,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:57:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:47,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-10-24 00:57:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:47,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-10-24 00:57:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:47,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-10-24 00:57:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:47,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-10-24 00:57:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:57:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:57:47,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1970191791] [2020-10-24 00:57:47,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:57:47,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:57:47,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937889789] [2020-10-24 00:57:47,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:57:47,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:57:47,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:57:47,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:57:47,569 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 20 states. [2020-10-24 00:57:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:57:49,628 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2020-10-24 00:57:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-10-24 00:57:49,629 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 79 [2020-10-24 00:57:49,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:57:49,630 INFO L225 Difference]: With dead ends: 93 [2020-10-24 00:57:49,630 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:57:49,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=298, Invalid=1424, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 00:57:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:57:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:57:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:57:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:57:49,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2020-10-24 00:57:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:57:49,633 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:57:49,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:57:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:57:49,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:57:49,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:57:49,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:57:50,844 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2020-10-24 00:57:50,986 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-10-24 00:57:51,142 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-10-24 00:57:51,280 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-10-24 00:57:51,448 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2020-10-24 00:57:51,631 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-10-24 00:57:51,814 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2020-10-24 00:57:52,009 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2020-10-24 00:57:52,279 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2020-10-24 00:57:52,409 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-10-24 00:57:52,578 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-10-24 00:57:52,824 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2020-10-24 00:57:52,954 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2020-10-24 00:57:53,138 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-10-24 00:57:53,324 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2020-10-24 00:57:53,497 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-10-24 00:57:53,720 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2020-10-24 00:57:54,094 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2020-10-24 00:57:54,338 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2020-10-24 00:57:54,470 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-10-24 00:57:54,718 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2020-10-24 00:57:54,925 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2020-10-24 00:57:55,064 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-10-24 00:57:55,306 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2020-10-24 00:57:55,566 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-10-24 00:57:55,866 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-10-24 00:57:56,036 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-10-24 00:57:56,383 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2020-10-24 00:57:56,596 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2020-10-24 00:57:56,754 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-10-24 00:57:56,920 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2020-10-24 00:57:56,925 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,925 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,925 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,926 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,926 INFO L277 CegarLoopResult]: At program point L5-4(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,926 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:57:56,926 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:57:56,926 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,927 INFO L270 CegarLoopResult]: 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|)) [2020-10-24 00:57:56,927 INFO L277 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,927 INFO L277 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,927 INFO L277 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,928 INFO L277 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: true [2020-10-24 00:57:56,928 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:57:56,928 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:57:56,928 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:57:56,928 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:57:56,928 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:57:56,929 INFO L277 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2020-10-24 00:57:56,929 INFO L277 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-10-24 00:57:56,929 INFO L277 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-10-24 00:57:56,929 INFO L277 CegarLoopResult]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2020-10-24 00:57:56,929 INFO L277 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2020-10-24 00:57:56,929 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 41 50) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:57:56,929 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 41 50) the Hoare annotation is: true [2020-10-24 00:57:56,929 INFO L277 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: true [2020-10-24 00:57:56,929 INFO L277 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-10-24 00:57:56,930 INFO L270 CegarLoopResult]: 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|)))) [2020-10-24 00:57:56,930 INFO L270 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-10-24 00:57:56,930 INFO L277 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: true [2020-10-24 00:57:56,930 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 41 50) the Hoare annotation is: true [2020-10-24 00:57:56,930 INFO L270 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:57:56,930 INFO L270 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc17.base|)) [2020-10-24 00:57:56,930 INFO L277 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: true [2020-10-24 00:57:56,930 INFO L270 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:57:56,931 INFO L277 CegarLoopResult]: At program point L46-3(line 46) the Hoare annotation is: true [2020-10-24 00:57:56,931 INFO L270 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:57:56,931 INFO L270 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:57:56,931 INFO L270 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4))) (and (or .cse0 (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) .cse2 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (not (<= 1 |check_#in~x|)) .cse3 .cse2)))) [2020-10-24 00:57:56,931 INFO L270 CegarLoopResult]: At program point L35-2(line 35) 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_~ax~0 0)) (.cse3 (= |check_#t~mem15| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse6 (+ check_~y 1))) (and .cse2 .cse3 (<= .cse6 |check_#in~n|) .cse4 (<= .cse6 check_~n) .cse5 (<= 1 check_~x))))))) [2020-10-24 00:57:56,931 INFO L270 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4))) (and (or .cse0 (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) .cse2 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (not (<= 1 |check_#in~x|)) .cse3 .cse2)))) [2020-10-24 00:57:56,932 INFO L277 CegarLoopResult]: At program point checkENTRY(lines 16 39) the Hoare annotation is: true [2020-10-24 00:57:56,932 INFO L270 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.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 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:57:56,932 INFO L270 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem8| 0)) (.cse3 (<= .cse7 |check_#in~n|)) (.cse4 (<= .cse7 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse6)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (= check_~x 0))) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse1)))) [2020-10-24 00:57:56,932 INFO L270 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.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 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:57:56,933 INFO L270 CegarLoopResult]: 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 ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (= |check_#t~mem8| 0)) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= |check_#t~mem9| 0)) (.cse6 (= (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 .cse5 .cse6 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 (= check_~x 0)))))) [2020-10-24 00:57:56,933 INFO L270 CegarLoopResult]: At program point L25-3(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|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (= |check_#t~mem8| 0)) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= |check_#t~mem9| 0)) (.cse6 (= (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 .cse5 .cse6 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 (= check_~x 0)))))) [2020-10-24 00:57:56,933 INFO L270 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem8| 0)) (.cse3 (<= .cse7 |check_#in~n|)) (.cse4 (<= .cse7 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse6)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (= check_~x 0))) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse1)))) [2020-10-24 00:57:56,933 INFO L270 CegarLoopResult]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.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 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:57:56,933 INFO L270 CegarLoopResult]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse6 (+ check_~y 1)) (.cse5 ((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|) .cse5))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5))) (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 .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 1 check_~x)))))) [2020-10-24 00:57:56,934 INFO L270 CegarLoopResult]: At program point L25-7(line 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (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)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-10-24 00:57:56,934 INFO L270 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.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 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:57:56,934 INFO L270 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse1 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 (and .cse1 .cse2 (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or (and .cse1 .cse2 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:57:56,934 INFO L270 CegarLoopResult]: At program point L25-9(line 25) 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 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:57:56,935 INFO L270 CegarLoopResult]: At program point L25-10(line 25) 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 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:57:56,935 INFO L270 CegarLoopResult]: At program point L25-11(lines 25 26) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (<= .cse6 |check_#in~n|)) (.cse2 (<= .cse6 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (and .cse1 .cse2 .cse3 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or .cse0 (and .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:57:56,935 INFO L270 CegarLoopResult]: At program point checkFINAL(lines 16 39) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-10-24 00:57:56,935 INFO L270 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= check_~ax~0 0)) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or (and .cse0 .cse1 .cse2) .cse3 (not (<= 1 |check_#in~x|)) .cse4) (or (let ((.cse5 (+ check_~y 1))) (and .cse0 (<= .cse5 |check_#in~n|) .cse1 (<= .cse5 check_~n) .cse2 (<= 1 check_~x))) .cse3 (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:57:56,935 INFO L270 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse0)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)))) [2020-10-24 00:57:56,935 INFO L270 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (= |check_#t~mem14| 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or (let ((.cse4 (+ check_~y 1))) (and .cse2 (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) .cse3 (<= 1 check_~x))) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:57:56,936 INFO L270 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem14| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (let ((.cse5 (+ check_~y 1))) (and .cse2 (<= .cse5 |check_#in~n|) .cse3 (<= .cse5 check_~n) .cse4 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:57:56,936 INFO L270 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4))) (and (or .cse0 (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) .cse2 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (not (<= 1 |check_#in~x|)) .cse3 .cse2)))) [2020-10-24 00:57:56,936 INFO L270 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4))) (and (or .cse0 (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) .cse2 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (not (<= 1 |check_#in~x|)) .cse3 .cse2)))) [2020-10-24 00:57:56,936 INFO L270 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4))) (and (or .cse0 (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) .cse2 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (not (<= 1 |check_#in~x|)) .cse3 .cse2)))) [2020-10-24 00:57:56,937 INFO L270 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4))) (and (or .cse0 (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) .cse2 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (not (<= 1 |check_#in~x|)) .cse3 .cse2)))) [2020-10-24 00:57:56,937 INFO L270 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4))) (and (or .cse0 (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) .cse2 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (not (<= 1 |check_#in~x|)) .cse3 .cse2)))) [2020-10-24 00:57:56,937 INFO L270 CegarLoopResult]: At program point L26(line 26) 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 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:57:56,937 INFO L270 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse4))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4))) (and (or .cse0 (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) .cse2 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse3) (or .cse0 (not (<= 1 |check_#in~x|)) .cse3 .cse2)))) [2020-10-24 00:57:56,938 INFO L270 CegarLoopResult]: At program point L26-1(line 26) 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 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:57:56,938 INFO L270 CegarLoopResult]: At program point L26-2(line 26) 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 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-10-24 00:57:56,938 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.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 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:57:56,938 INFO L270 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.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 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-10-24 00:57:56,939 INFO L270 CegarLoopResult]: At program point checkEXIT(lines 16 39) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-10-24 00:57:56,939 INFO L270 CegarLoopResult]: 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)))) [2020-10-24 00:57:56,939 INFO L270 CegarLoopResult]: 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|)) (.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)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1))) [2020-10-24 00:57:56,939 INFO L270 CegarLoopResult]: At program point L16-2(lines 16 39) the Hoare annotation is: (let ((.cse4 ((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) .cse4)) (.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 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse2 .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-10-24 00:57:56,940 INFO L270 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (let ((.cse5 ((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|) .cse5))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) .cse2 (<= .cse4 check_~n) .cse3 (<= 1 check_~x))))))) [2020-10-24 00:57:56,940 INFO L270 CegarLoopResult]: At program point L35-1(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 (= |check_#t~mem15| 0)) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse1 .cse2 .cse3) .cse4) (or .cse0 (let ((.cse5 (+ check_~y 1))) (and .cse1 (<= .cse5 |check_#in~n|) .cse2 (<= .cse5 check_~n) .cse3 (<= 1 check_~x))) (not (= |check_#in~x| 0)) .cse4)))) [2020-10-24 00:57:56,940 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2020-10-24 00:57:56,940 INFO L270 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 00:57:56,940 INFO L270 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 00:57:56,941 INFO L270 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 00:57:56,941 INFO L270 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 00:57:56,941 INFO L270 CegarLoopResult]: At program point L11-4(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 00:57:56,941 INFO L270 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-10-24 00:57:56,941 INFO L270 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-10-24 00:57:56,941 INFO L270 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-10-24 00:57:56,967 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:238) 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:707) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) 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) [2020-10-24 00:57:56,971 INFO L168 Benchmark]: Toolchain (without parser) took 18052.04 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 127.1 MB in the beginning and 172.3 MB in the end (delta: -45.2 MB). Peak memory consumption was 188.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:56,971 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 125.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:57:56,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.64 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 116.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:56,973 INFO L168 Benchmark]: Boogie Preprocessor took 42.78 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 114.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:56,974 INFO L168 Benchmark]: RCFGBuilder took 675.15 ms. Allocated memory is still 151.0 MB. Free memory was 114.9 MB in the beginning and 129.0 MB in the end (delta: -14.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:56,975 INFO L168 Benchmark]: TraceAbstraction took 17048.94 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 128.5 MB in the beginning and 172.3 MB in the end (delta: -43.8 MB). Peak memory consumption was 189.5 MB. Max. memory is 8.0 GB. [2020-10-24 00:57:56,978 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.22 ms. Allocated memory is still 151.0 MB. Free memory is still 125.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 273.64 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 116.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.78 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 114.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 675.15 ms. Allocated memory is still 151.0 MB. Free memory was 114.9 MB in the beginning and 129.0 MB in the end (delta: -14.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17048.94 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 128.5 MB in the beginning and 172.3 MB in the end (delta: -43.8 MB). Peak memory consumption was 189.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - 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:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...