/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:37:22,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:37:22,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:37:22,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:37:22,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:37:22,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:37:22,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:37:22,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:37:22,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:37:22,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:37:22,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:37:22,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:37:22,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:37:22,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:37:22,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:37:22,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:37:22,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:37:22,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:37:22,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:37:22,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:37:22,730 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:37:22,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:37:22,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:37:22,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:37:22,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:37:22,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:37:22,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:37:22,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:37:22,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:37:22,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:37:22,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:37:22,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:37:22,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:37:22,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:37:22,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:37:22,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:37:22,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:37:22,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:37:22,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:37:22,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:37:22,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:37:22,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:37:22,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:37:22,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:37:22,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:37:22,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:37:22,794 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:37:22,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:37:22,796 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:37:22,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:37:22,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:37:22,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:37:22,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:37:22,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:37:22,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:37:22,799 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:37:22,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:37:22,799 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:37:22,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:37:22,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:37:22,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:37:22,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:37:22,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:37:22,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:37:22,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:37:22,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:37:22,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:37:22,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:37:22,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:37:22,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:37:22,802 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:37:22,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2020-11-06 22:37:23,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:37:23,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:37:23,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:37:23,277 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:37:23,277 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:37:23,278 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c [2020-11-06 22:37:23,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782ce5b66/c68b1ed4f05e4807a18f37f0ac2e3f9d/FLAG3e6696cba [2020-11-06 22:37:24,225 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:37:24,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label43.c [2020-11-06 22:37:24,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782ce5b66/c68b1ed4f05e4807a18f37f0ac2e3f9d/FLAG3e6696cba [2020-11-06 22:37:24,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782ce5b66/c68b1ed4f05e4807a18f37f0ac2e3f9d [2020-11-06 22:37:24,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:37:24,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:37:24,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:37:24,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:37:24,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:37:24,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:24" (1/1) ... [2020-11-06 22:37:24,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff2b8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:24, skipping insertion in model container [2020-11-06 22:37:24,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:24" (1/1) ... [2020-11-06 22:37:24,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:37:24,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:37:25,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:37:25,063 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:37:25,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:37:25,181 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:37:25,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25 WrapperNode [2020-11-06 22:37:25,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:37:25,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:37:25,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:37:25,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:37:25,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25" (1/1) ... [2020-11-06 22:37:25,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25" (1/1) ... [2020-11-06 22:37:25,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25" (1/1) ... [2020-11-06 22:37:25,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25" (1/1) ... [2020-11-06 22:37:25,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25" (1/1) ... [2020-11-06 22:37:25,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25" (1/1) ... [2020-11-06 22:37:25,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25" (1/1) ... [2020-11-06 22:37:25,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:37:25,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:37:25,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:37:25,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:37:25,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25" (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-11-06 22:37:25,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:37:25,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:37:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:37:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-11-06 22:37:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:37:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-11-06 22:37:25,444 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:37:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:37:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:37:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:37:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:37:25,445 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-06 22:37:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:37:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:37:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:37:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:37:25,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:37:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:37:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:37:27,210 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:37:27,210 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-06 22:37:27,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:27 BoogieIcfgContainer [2020-11-06 22:37:27,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:37:27,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:37:27,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:37:27,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:37:27,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:37:24" (1/3) ... [2020-11-06 22:37:27,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4903cbf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:37:27, skipping insertion in model container [2020-11-06 22:37:27,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:25" (2/3) ... [2020-11-06 22:37:27,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4903cbf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:37:27, skipping insertion in model container [2020-11-06 22:37:27,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:27" (3/3) ... [2020-11-06 22:37:27,224 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label43.c [2020-11-06 22:37:27,243 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:37:27,248 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:37:27,263 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:37:27,296 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:37:27,296 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:37:27,297 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:37:27,297 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:37:27,297 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:37:27,297 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:37:27,297 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:37:27,298 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:37:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states. [2020-11-06 22:37:27,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-06 22:37:27,337 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:37:27,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:37:27,339 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:37:27,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:37:27,346 INFO L82 PathProgramCache]: Analyzing trace with hash -969779467, now seen corresponding path program 1 times [2020-11-06 22:37:27,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:37:27,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898983514] [2020-11-06 22:37:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:37:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:28,071 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-06 22:37:28,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:37:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:37:28,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898983514] [2020-11-06 22:37:28,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:37:28,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-06 22:37:28,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748874882] [2020-11-06 22:37:28,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:37:28,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:37:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:37:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:37:28,179 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 4 states. [2020-11-06 22:37:28,401 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-06 22:37:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:37:31,331 INFO L93 Difference]: Finished difference Result 667 states and 1119 transitions. [2020-11-06 22:37:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:37:31,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2020-11-06 22:37:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:37:31,351 INFO L225 Difference]: With dead ends: 667 [2020-11-06 22:37:31,351 INFO L226 Difference]: Without dead ends: 342 [2020-11-06 22:37:31,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:37:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2020-11-06 22:37:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2020-11-06 22:37:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-11-06 22:37:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 489 transitions. [2020-11-06 22:37:31,452 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 489 transitions. Word has length 92 [2020-11-06 22:37:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:37:31,454 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 489 transitions. [2020-11-06 22:37:31,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:37:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 489 transitions. [2020-11-06 22:37:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-06 22:37:31,460 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:37:31,460 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-11-06 22:37:31,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:37:31,461 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:37:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:37:31,462 INFO L82 PathProgramCache]: Analyzing trace with hash 417622825, now seen corresponding path program 1 times [2020-11-06 22:37:31,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:37:31,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358288092] [2020-11-06 22:37:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:37:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:31,761 WARN L194 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-06 22:37:31,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:37:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:31,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:37:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:37:31,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358288092] [2020-11-06 22:37:31,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:37:31,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:37:31,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59604146] [2020-11-06 22:37:31,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:37:31,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:37:31,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:37:31,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:37:31,907 INFO L87 Difference]: Start difference. First operand 338 states and 489 transitions. Second operand 7 states. [2020-11-06 22:37:32,117 WARN L194 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-06 22:37:32,814 WARN L194 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-06 22:37:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:37:34,817 INFO L93 Difference]: Finished difference Result 991 states and 1464 transitions. [2020-11-06 22:37:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:37:34,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2020-11-06 22:37:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:37:34,825 INFO L225 Difference]: With dead ends: 991 [2020-11-06 22:37:34,825 INFO L226 Difference]: Without dead ends: 659 [2020-11-06 22:37:34,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:37:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-11-06 22:37:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 643. [2020-11-06 22:37:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-11-06 22:37:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 883 transitions. [2020-11-06 22:37:34,919 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 883 transitions. Word has length 100 [2020-11-06 22:37:34,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:37:34,919 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 883 transitions. [2020-11-06 22:37:34,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:37:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 883 transitions. [2020-11-06 22:37:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-06 22:37:34,925 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:37:34,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:37:34,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:37:34,926 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:37:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:37:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash -46441168, now seen corresponding path program 1 times [2020-11-06 22:37:34,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:37:34,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357440511] [2020-11-06 22:37:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:37:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:35,136 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-06 22:37:35,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:37:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:35,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:37:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:37:35,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357440511] [2020-11-06 22:37:35,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:37:35,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:37:35,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811416863] [2020-11-06 22:37:35,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:37:35,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:37:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:37:35,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:37:35,269 INFO L87 Difference]: Start difference. First operand 643 states and 883 transitions. Second operand 7 states. [2020-11-06 22:37:35,465 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-06 22:37:36,303 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-06 22:37:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:37:38,195 INFO L93 Difference]: Finished difference Result 1925 states and 2786 transitions. [2020-11-06 22:37:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:37:38,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2020-11-06 22:37:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:37:38,209 INFO L225 Difference]: With dead ends: 1925 [2020-11-06 22:37:38,209 INFO L226 Difference]: Without dead ends: 1288 [2020-11-06 22:37:38,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:37:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2020-11-06 22:37:38,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1256. [2020-11-06 22:37:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2020-11-06 22:37:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1691 transitions. [2020-11-06 22:37:38,314 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1691 transitions. Word has length 103 [2020-11-06 22:37:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:37:38,315 INFO L481 AbstractCegarLoop]: Abstraction has 1256 states and 1691 transitions. [2020-11-06 22:37:38,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:37:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1691 transitions. [2020-11-06 22:37:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-11-06 22:37:38,327 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:37:38,327 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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-11-06 22:37:38,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:37:38,328 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:37:38,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:37:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash 543072021, now seen corresponding path program 1 times [2020-11-06 22:37:38,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:37:38,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599333169] [2020-11-06 22:37:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:37:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:38,658 WARN L194 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-06 22:37:38,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:37:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:38,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:37:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:38,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-06 22:37:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:37:38,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599333169] [2020-11-06 22:37:38,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314680009] [2020-11-06 22:37:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:37:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:39,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:37:39,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:37:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-06 22:37:39,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:37:39,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2020-11-06 22:37:39,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258980586] [2020-11-06 22:37:39,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:37:39,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:37:39,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:37:39,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:37:39,221 INFO L87 Difference]: Start difference. First operand 1256 states and 1691 transitions. Second operand 5 states. [2020-11-06 22:37:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:37:40,965 INFO L93 Difference]: Finished difference Result 3746 states and 5150 transitions. [2020-11-06 22:37:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:37:40,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2020-11-06 22:37:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:37:40,983 INFO L225 Difference]: With dead ends: 3746 [2020-11-06 22:37:40,984 INFO L226 Difference]: Without dead ends: 2496 [2020-11-06 22:37:40,989 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:37:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2020-11-06 22:37:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2456. [2020-11-06 22:37:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2456 states. [2020-11-06 22:37:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 3039 transitions. [2020-11-06 22:37:41,126 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 3039 transitions. Word has length 112 [2020-11-06 22:37:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:37:41,127 INFO L481 AbstractCegarLoop]: Abstraction has 2456 states and 3039 transitions. [2020-11-06 22:37:41,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:37:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 3039 transitions. [2020-11-06 22:37:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-06 22:37:41,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:37:41,134 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:37:41,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:37:41,348 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:37:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:37:41,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2084392192, now seen corresponding path program 1 times [2020-11-06 22:37:41,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:37:41,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561415776] [2020-11-06 22:37:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:37:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:41,589 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-06 22:37:41,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:37:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:41,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:37:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:41,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:37:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:37:41,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561415776] [2020-11-06 22:37:41,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481820575] [2020-11-06 22:37:41,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:37:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:41,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-06 22:37:41,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:37:42,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-06 22:37:42,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:37:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:37:42,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:37:42,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2020-11-06 22:37:42,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932685467] [2020-11-06 22:37:42,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:37:42,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:37:42,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:37:42,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:37:42,116 INFO L87 Difference]: Start difference. First operand 2456 states and 3039 transitions. Second operand 11 states. [2020-11-06 22:37:42,642 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-06 22:37:43,624 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-06 22:37:43,889 WARN L194 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-06 22:37:44,443 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-06 22:37:44,759 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-06 22:37:44,993 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:37:46,215 WARN L194 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2020-11-06 22:37:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:37:50,359 INFO L93 Difference]: Finished difference Result 7108 states and 9649 transitions. [2020-11-06 22:37:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-06 22:37:50,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 113 [2020-11-06 22:37:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:37:50,398 INFO L225 Difference]: With dead ends: 7108 [2020-11-06 22:37:50,398 INFO L226 Difference]: Without dead ends: 4508 [2020-11-06 22:37:50,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2020-11-06 22:37:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4508 states. [2020-11-06 22:37:50,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4508 to 4274. [2020-11-06 22:37:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2020-11-06 22:37:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5189 transitions. [2020-11-06 22:37:50,568 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5189 transitions. Word has length 113 [2020-11-06 22:37:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:37:50,568 INFO L481 AbstractCegarLoop]: Abstraction has 4274 states and 5189 transitions. [2020-11-06 22:37:50,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:37:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5189 transitions. [2020-11-06 22:37:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-06 22:37:50,576 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:37:50,576 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:37:50,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:37:50,792 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:37:50,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:37:50,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1353508148, now seen corresponding path program 1 times [2020-11-06 22:37:50,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:37:50,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927421037] [2020-11-06 22:37:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:37:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:51,027 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-06 22:37:51,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:37:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:51,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:37:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:51,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-06 22:37:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:51,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:37:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-06 22:37:51,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927421037] [2020-11-06 22:37:51,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009768360] [2020-11-06 22:37:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:37:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:37:51,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-06 22:37:51,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:37:51,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-06 22:37:51,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:37:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-06 22:37:51,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:37:51,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 14 [2020-11-06 22:37:51,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652904837] [2020-11-06 22:37:51,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:37:51,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:37:51,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:37:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:37:51,570 INFO L87 Difference]: Start difference. First operand 4274 states and 5189 transitions. Second operand 14 states. [2020-11-06 22:37:51,830 WARN L194 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-11-06 22:37:52,434 WARN L194 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-11-06 22:37:52,715 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:37:53,770 WARN L194 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:37:54,195 WARN L194 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2020-11-06 22:37:54,525 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:37:55,095 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-06 22:37:55,907 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-06 22:37:56,126 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:37:56,792 WARN L194 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-06 22:37:57,611 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-11-06 22:37:58,308 WARN L194 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-11-06 22:37:58,610 WARN L194 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-06 22:37:59,156 WARN L194 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2020-11-06 22:38:01,124 WARN L194 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2020-11-06 22:38:01,495 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-06 22:38:01,700 WARN L194 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-11-06 22:38:02,155 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-11-06 22:38:04,350 WARN L194 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2020-11-06 22:38:06,047 WARN L194 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-11-06 22:38:06,399 WARN L194 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-11-06 22:38:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:38:09,287 INFO L93 Difference]: Finished difference Result 10840 states and 14196 transitions. [2020-11-06 22:38:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2020-11-06 22:38:09,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 121 [2020-11-06 22:38:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:38:09,329 INFO L225 Difference]: With dead ends: 10840 [2020-11-06 22:38:09,329 INFO L226 Difference]: Without dead ends: 6572 [2020-11-06 22:38:09,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2763 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1085, Invalid=6397, Unknown=0, NotChecked=0, Total=7482 [2020-11-06 22:38:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6572 states. [2020-11-06 22:38:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6572 to 6483. [2020-11-06 22:38:09,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6483 states. [2020-11-06 22:38:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6483 states to 6483 states and 7939 transitions. [2020-11-06 22:38:09,573 INFO L78 Accepts]: Start accepts. Automaton has 6483 states and 7939 transitions. Word has length 121 [2020-11-06 22:38:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:38:09,574 INFO L481 AbstractCegarLoop]: Abstraction has 6483 states and 7939 transitions. [2020-11-06 22:38:09,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:38:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 6483 states and 7939 transitions. [2020-11-06 22:38:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-11-06 22:38:09,586 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:38:09,586 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:38:09,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:38:09,801 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:38:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:38:09,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1911016350, now seen corresponding path program 1 times [2020-11-06 22:38:09,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:38:09,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228676767] [2020-11-06 22:38:09,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:38:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:38:09,840 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:38:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:38:09,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:38:09,945 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:38:09,945 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:38:09,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:38:10,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:38:10 BoogieIcfgContainer [2020-11-06 22:38:10,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:38:10,132 INFO L168 Benchmark]: Toolchain (without parser) took 45622.98 ms. Allocated memory was 163.6 MB in the beginning and 412.1 MB in the end (delta: 248.5 MB). Free memory was 136.7 MB in the beginning and 175.3 MB in the end (delta: -38.6 MB). Peak memory consumption was 210.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:38:10,133 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 163.6 MB. Free memory is still 136.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:38:10,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.28 ms. Allocated memory is still 163.6 MB. Free memory was 136.1 MB in the beginning and 110.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2020-11-06 22:38:10,139 INFO L168 Benchmark]: Boogie Preprocessor took 162.22 ms. Allocated memory is still 163.6 MB. Free memory was 110.4 MB in the beginning and 141.7 MB in the end (delta: -31.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:38:10,145 INFO L168 Benchmark]: RCFGBuilder took 1866.50 ms. Allocated memory was 163.6 MB in the beginning and 197.1 MB in the end (delta: 33.6 MB). Free memory was 141.7 MB in the beginning and 161.3 MB in the end (delta: -19.6 MB). Peak memory consumption was 91.2 MB. Max. memory is 8.0 GB. [2020-11-06 22:38:10,146 INFO L168 Benchmark]: TraceAbstraction took 42915.67 ms. Allocated memory was 197.1 MB in the beginning and 412.1 MB in the end (delta: 215.0 MB). Free memory was 160.8 MB in the beginning and 175.3 MB in the end (delta: -14.5 MB). Peak memory consumption was 200.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:38:10,151 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.17 ms. Allocated memory is still 163.6 MB. Free memory is still 136.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 667.28 ms. Allocated memory is still 163.6 MB. Free memory was 136.1 MB in the beginning and 110.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 162.22 ms. Allocated memory is still 163.6 MB. Free memory was 110.4 MB in the beginning and 141.7 MB in the end (delta: -31.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1866.50 ms. Allocated memory was 163.6 MB in the beginning and 197.1 MB in the end (delta: 33.6 MB). Free memory was 141.7 MB in the beginning and 161.3 MB in the end (delta: -19.6 MB). Peak memory consumption was 91.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 42915.67 ms. Allocated memory was 197.1 MB in the beginning and 412.1 MB in the end (delta: 215.0 MB). Free memory was 160.8 MB in the beginning and 175.3 MB in the end (delta: -14.5 MB). Peak memory consumption was 200.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int a= 1; [L10] int e= 5; [L11] int d= 4; [L12] int f= 6; [L13] int c= 3; [L16] int u = 21; [L17] int v = 22; [L18] int w = 23; [L19] int x = 24; [L20] int y = 25; [L21] int z = 26; [L24] int a25 = 0; [L25] int a11 = 0; [L26] int a28 = 7; [L27] int a19 = 1; [L28] int a21 = 1; [L29] int a17 = 8; VAL [\old(a)=59, \old(a11)=72, \old(a17)=51, \old(a19)=64, \old(a21)=53, \old(a25)=56, \old(a28)=73, \old(c)=65, \old(d)=69, \old(e)=50, \old(f)=58, \old(u)=70, \old(v)=61, \old(w)=60, \old(x)=52, \old(y)=71, \old(z)=66, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L605] int output = -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L32] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L37] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L44] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L56] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L61] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L67] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L71] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L76] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L93] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L115] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L121] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L125] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L132] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L141] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L145] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L156] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L161] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L167] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L168] a25 = 1 [L169] a28 = 9 [L170] return 26; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L616] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] output = calculate_output(input) [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L616] CALL, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L32] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L33] a28 = 9 [L34] a11 = 1 [L35] a25 = 1 [L36] return -1; VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L616] RET, EXPR calculate_output(input) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L616] output = calculate_output(input) [L608] COND TRUE 1 [L611] int input; [L612] input = __VERIFIER_nondet_int() [L613] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L616] CALL calculate_output(input) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L32] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L37] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L40] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L44] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L56] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L61] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L67] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L71] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L76] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L93] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L115] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L121] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L125] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L132] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L141] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L145] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L156] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L161] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L167] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L171] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L177] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L181] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L193] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L200] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L217] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L220] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L227] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L236] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L239] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L282] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L285] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L295] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L311] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L330] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L351] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L356] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L370] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L396] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L400] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L406] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L411] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L416] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L422] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L425] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L428] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L429] CALL reach_error() VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L4] __assert_fail("0", "Problem02_label43.c", 4, "reach_error") VAL [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 240 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 42.6s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 292 SDtfs, 7182 SDslu, 615 SDs, 0 SdLazy, 9299 SolverSat, 2320 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3056 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6483occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 6 MinimizatonAttempts, 415 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1121 NumberOfCodeBlocks, 1121 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 978 ConstructedInterpolants, 0 QuantifiedInterpolants, 234694 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 172/193 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...