/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options interpolation-heuristic=FIRST --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 11:27:46,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 11:27:46,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 11:27:46,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 11:27:46,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 11:27:46,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 11:27:46,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 11:27:46,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 11:27:46,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 11:27:46,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 11:27:46,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 11:27:46,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 11:27:46,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 11:27:46,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 11:27:46,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 11:27:46,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 11:27:46,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 11:27:46,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 11:27:46,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 11:27:46,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 11:27:46,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 11:27:46,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 11:27:46,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 11:27:46,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 11:27:46,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 11:27:46,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 11:27:46,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 11:27:46,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 11:27:46,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 11:27:46,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 11:27:46,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 11:27:46,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 11:27:46,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 11:27:46,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 11:27:46,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 11:27:46,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 11:27:46,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 11:27:46,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 11:27:46,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 11:27:46,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 11:27:46,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 11:27:46,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 11:27:46,518 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 11:27:46,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 11:27:46,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 11:27:46,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 11:27:46,520 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 11:27:46,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 11:27:46,521 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 11:27:46,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 11:27:46,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 11:27:46,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 11:27:46,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 11:27:46,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 11:27:46,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 11:27:46,522 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 11:27:46,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 11:27:46,522 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 11:27:46,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 11:27:46,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 11:27:46,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 11:27:46,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 11:27:46,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 11:27:46,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 11:27:46,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 11:27:46,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 11:27:46,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 11:27:46,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 11:27:46,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 11:27:46,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 11:27:46,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 11:27:46,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;interpolation-heuristic=FIRST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;interpolation-heuristic=FIRST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;interpolation-heuristic=FIRST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;interpolation-heuristic=FIRST;log-additional-information=true; [2020-09-21 11:27:47,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 11:27:47,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 11:27:47,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 11:27:47,036 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 11:27:47,036 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 11:27:47,038 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-21 11:27:47,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d1317d44d/6c635c69e4bd499db50a17c9e99b0551/FLAG900ac3f34 [2020-09-21 11:27:47,741 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 11:27:47,742 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-21 11:27:47,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d1317d44d/6c635c69e4bd499db50a17c9e99b0551/FLAG900ac3f34 [2020-09-21 11:27:47,981 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d1317d44d/6c635c69e4bd499db50a17c9e99b0551 [2020-09-21 11:27:47,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 11:27:48,002 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 11:27:48,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 11:27:48,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 11:27:48,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 11:27:48,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:27:47" (1/1) ... [2020-09-21 11:27:48,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad15a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48, skipping insertion in model container [2020-09-21 11:27:48,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:27:47" (1/1) ... [2020-09-21 11:27:48,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 11:27:48,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 11:27:48,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 11:27:48,547 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 11:27:48,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 11:27:48,801 INFO L208 MainTranslator]: Completed translation [2020-09-21 11:27:48,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48 WrapperNode [2020-09-21 11:27:48,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 11:27:48,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 11:27:48,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 11:27:48,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 11:27:48,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48" (1/1) ... [2020-09-21 11:27:48,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48" (1/1) ... [2020-09-21 11:27:48,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48" (1/1) ... [2020-09-21 11:27:48,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48" (1/1) ... [2020-09-21 11:27:48,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48" (1/1) ... [2020-09-21 11:27:48,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48" (1/1) ... [2020-09-21 11:27:48,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48" (1/1) ... [2020-09-21 11:27:48,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 11:27:48,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 11:27:48,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 11:27:48,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 11:27:48,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-21 11:27:49,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 11:27:49,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 11:27:49,037 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 11:27:49,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 11:27:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 11:27:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 11:27:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 11:27:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 11:27:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 11:27:49,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 11:27:49,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 11:27:50,398 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 11:27:50,399 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 11:27:50,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:27:50 BoogieIcfgContainer [2020-09-21 11:27:50,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 11:27:50,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 11:27:50,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 11:27:50,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 11:27:50,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:27:47" (1/3) ... [2020-09-21 11:27:50,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc07a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:27:50, skipping insertion in model container [2020-09-21 11:27:50,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:48" (2/3) ... [2020-09-21 11:27:50,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc07a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:27:50, skipping insertion in model container [2020-09-21 11:27:50,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:27:50" (3/3) ... [2020-09-21 11:27:50,419 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-09-21 11:27:50,431 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 11:27:50,441 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 11:27:50,463 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 11:27:50,510 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 11:27:50,511 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 11:27:50,511 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 11:27:50,511 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 11:27:50,511 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 11:27:50,511 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 11:27:50,512 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 11:27:50,512 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 11:27:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-09-21 11:27:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-21 11:27:50,552 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:50,553 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] [2020-09-21 11:27:50,553 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:50,561 INFO L82 PathProgramCache]: Analyzing trace with hash -42109674, now seen corresponding path program 1 times [2020-09-21 11:27:50,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:50,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542750188] [2020-09-21 11:27:50,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:50,785 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:50,785 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:50,785 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:50,786 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:50,786 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 32 [2020-09-21 11:27:50,786 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:50,786 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 60 [2020-09-21 11:27:50,787 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:50,787 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:27:50,787 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:27:50,787 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 25 [2020-09-21 11:27:50,788 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:27:50,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:50,982 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:50,982 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:50,982 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:50,983 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:50,983 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:50,983 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:50,984 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-09-21 11:27:50,984 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:50,984 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:50,984 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:50,984 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:27:50,985 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:27:51,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542750188] [2020-09-21 11:27:51,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:27:51,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 11:27:51,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448692809] [2020-09-21 11:27:51,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 11:27:51,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:51,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 11:27:51,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 11:27:51,057 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-09-21 11:27:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:52,756 INFO L93 Difference]: Finished difference Result 596 states and 1021 transitions. [2020-09-21 11:27:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 11:27:52,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-09-21 11:27:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:52,795 INFO L225 Difference]: With dead ends: 596 [2020-09-21 11:27:52,796 INFO L226 Difference]: Without dead ends: 302 [2020-09-21 11:27:52,817 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 11:27:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-09-21 11:27:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2020-09-21 11:27:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-09-21 11:27:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 430 transitions. [2020-09-21 11:27:52,944 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 430 transitions. Word has length 23 [2020-09-21 11:27:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:52,945 INFO L479 AbstractCegarLoop]: Abstraction has 298 states and 430 transitions. [2020-09-21 11:27:52,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 11:27:52,945 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 430 transitions. [2020-09-21 11:27:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 11:27:52,950 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:52,951 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2020-09-21 11:27:52,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 11:27:52,951 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash 547923706, now seen corresponding path program 1 times [2020-09-21 11:27:52,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:52,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [494705359] [2020-09-21 11:27:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:53,082 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:53,082 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:53,082 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:53,083 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:53,083 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 108 [2020-09-21 11:27:53,083 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:53,083 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 64 [2020-09-21 11:27:53,084 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:53,084 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:27:53,084 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:27:53,084 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 80 [2020-09-21 11:27:53,085 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:53,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:53,197 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:53,198 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:53,198 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:53,198 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:53,198 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:53,199 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:53,199 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-09-21 11:27:53,199 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:53,200 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:53,200 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:53,200 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:27:53,200 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:27:53,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:27:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:53,266 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:53,267 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:53,267 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:53,267 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:53,268 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 76 [2020-09-21 11:27:53,268 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:53,268 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 20 [2020-09-21 11:27:53,268 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:53,269 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:53,269 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:27:53,269 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 75 [2020-09-21 11:27:53,269 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:27:53,398 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [494705359] [2020-09-21 11:27:53,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:27:53,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 11:27:53,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615373965] [2020-09-21 11:27:53,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 11:27:53,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 11:27:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 11:27:53,403 INFO L87 Difference]: Start difference. First operand 298 states and 430 transitions. Second operand 8 states. [2020-09-21 11:27:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:55,898 INFO L93 Difference]: Finished difference Result 1198 states and 1805 transitions. [2020-09-21 11:27:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 11:27:55,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2020-09-21 11:27:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:55,906 INFO L225 Difference]: With dead ends: 1198 [2020-09-21 11:27:55,906 INFO L226 Difference]: Without dead ends: 906 [2020-09-21 11:27:55,908 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-09-21 11:27:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2020-09-21 11:27:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 894. [2020-09-21 11:27:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-09-21 11:27:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1232 transitions. [2020-09-21 11:27:55,965 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1232 transitions. Word has length 97 [2020-09-21 11:27:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:55,966 INFO L479 AbstractCegarLoop]: Abstraction has 894 states and 1232 transitions. [2020-09-21 11:27:55,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 11:27:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1232 transitions. [2020-09-21 11:27:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-09-21 11:27:55,969 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:55,969 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 11:27:55,970 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 11:27:55,970 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1249958265, now seen corresponding path program 1 times [2020-09-21 11:27:55,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:55,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495623407] [2020-09-21 11:27:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:56,030 FATAL L256 erpolLogProxyWrapper]: Difference in size: 5 [2020-09-21 11:27:56,031 FATAL L256 erpolLogProxyWrapper]: Difference in depth: -84 [2020-09-21 11:27:56,031 FATAL L256 erpolLogProxyWrapper]: Difference in width: 84 [2020-09-21 11:27:56,031 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:56,032 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 113 [2020-09-21 11:27:56,032 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:56,032 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 18 [2020-09-21 11:27:56,032 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:56,033 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:56,033 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 90 [2020-09-21 11:27:56,033 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 22 [2020-09-21 11:27:56,033 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:56,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:56,103 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:56,104 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:56,104 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:56,104 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:56,104 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:56,105 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:56,105 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1 [2020-09-21 11:27:56,105 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:56,105 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 11:27:56,106 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:56,106 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 11:27:56,106 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:56,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:27:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:56,147 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:56,147 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:56,147 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:56,148 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:56,148 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 81 [2020-09-21 11:27:56,148 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:56,148 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 11:27:56,149 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:56,149 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:56,149 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:56,149 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 11:27:56,150 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:27:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:27:56,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495623407] [2020-09-21 11:27:56,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:27:56,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 11:27:56,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95309420] [2020-09-21 11:27:56,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 11:27:56,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:56,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 11:27:56,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 11:27:56,204 INFO L87 Difference]: Start difference. First operand 894 states and 1232 transitions. Second operand 6 states. [2020-09-21 11:27:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:57,587 INFO L93 Difference]: Finished difference Result 1786 states and 2476 transitions. [2020-09-21 11:27:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 11:27:57,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2020-09-21 11:27:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:57,594 INFO L225 Difference]: With dead ends: 1786 [2020-09-21 11:27:57,595 INFO L226 Difference]: Without dead ends: 898 [2020-09-21 11:27:57,598 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-09-21 11:27:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2020-09-21 11:27:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 894. [2020-09-21 11:27:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-09-21 11:27:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1182 transitions. [2020-09-21 11:27:57,633 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1182 transitions. Word has length 102 [2020-09-21 11:27:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:57,633 INFO L479 AbstractCegarLoop]: Abstraction has 894 states and 1182 transitions. [2020-09-21 11:27:57,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 11:27:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1182 transitions. [2020-09-21 11:27:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-21 11:27:57,637 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:57,638 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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-09-21 11:27:57,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 11:27:57,638 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash -99512690, now seen corresponding path program 1 times [2020-09-21 11:27:57,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:57,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1682538893] [2020-09-21 11:27:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:57,712 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:57,712 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:57,712 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:57,713 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:57,713 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 134 [2020-09-21 11:27:57,713 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:57,713 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 29 [2020-09-21 11:27:57,713 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:57,714 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:27:57,714 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:27:57,714 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 106 [2020-09-21 11:27:57,714 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:57,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:27:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:57,817 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:57,818 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:57,818 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:57,819 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:57,819 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:27:57,819 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:57,819 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-09-21 11:27:57,820 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:57,820 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:27:57,820 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:27:57,820 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:27:57,820 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:57,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:27:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:57,898 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:57,899 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:57,899 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:57,899 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:57,899 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 102 [2020-09-21 11:27:57,900 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:57,900 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 30 [2020-09-21 11:27:57,900 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:57,900 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:27:57,901 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:27:57,901 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 101 [2020-09-21 11:27:57,901 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:27:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:27:58,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1682538893] [2020-09-21 11:27:58,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:27:58,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 11:27:58,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27969943] [2020-09-21 11:27:58,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 11:27:58,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:27:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 11:27:58,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 11:27:58,045 INFO L87 Difference]: Start difference. First operand 894 states and 1182 transitions. Second operand 8 states. [2020-09-21 11:27:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:27:59,650 INFO L93 Difference]: Finished difference Result 2412 states and 3332 transitions. [2020-09-21 11:27:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 11:27:59,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2020-09-21 11:27:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:27:59,667 INFO L225 Difference]: With dead ends: 2412 [2020-09-21 11:27:59,667 INFO L226 Difference]: Without dead ends: 1524 [2020-09-21 11:27:59,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-09-21 11:27:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2020-09-21 11:27:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1482. [2020-09-21 11:27:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2020-09-21 11:27:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1870 transitions. [2020-09-21 11:27:59,753 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1870 transitions. Word has length 123 [2020-09-21 11:27:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:27:59,755 INFO L479 AbstractCegarLoop]: Abstraction has 1482 states and 1870 transitions. [2020-09-21 11:27:59,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 11:27:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1870 transitions. [2020-09-21 11:27:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-21 11:27:59,761 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:27:59,761 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-21 11:27:59,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 11:27:59,762 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:27:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:27:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1701421403, now seen corresponding path program 1 times [2020-09-21 11:27:59,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:27:59,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405235132] [2020-09-21 11:27:59,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:27:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:27:59,924 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:27:59,924 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:27:59,924 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:27:59,925 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:27:59,926 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 151 [2020-09-21 11:27:59,926 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:27:59,926 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 94 [2020-09-21 11:27:59,926 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:27:59,926 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:27:59,927 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:27:59,927 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 123 [2020-09-21 11:27:59,927 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:00,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:00,018 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:00,018 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:00,018 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:00,018 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:00,019 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:00,019 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:00,019 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-09-21 11:28:00,019 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:00,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:00,020 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:00,020 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:28:00,020 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:00,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:28:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:00,171 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:00,172 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:00,172 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:00,172 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:00,172 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 119 [2020-09-21 11:28:00,173 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:00,173 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 99 [2020-09-21 11:28:00,173 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:00,173 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:00,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:28:00,174 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-09-21 11:28:00,174 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:28:00,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405235132] [2020-09-21 11:28:00,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:28:00,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 11:28:00,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381565124] [2020-09-21 11:28:00,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 11:28:00,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 11:28:00,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 11:28:00,328 INFO L87 Difference]: Start difference. First operand 1482 states and 1870 transitions. Second operand 7 states. [2020-09-21 11:28:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:01,890 INFO L93 Difference]: Finished difference Result 3131 states and 3957 transitions. [2020-09-21 11:28:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 11:28:01,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2020-09-21 11:28:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:01,901 INFO L225 Difference]: With dead ends: 3131 [2020-09-21 11:28:01,902 INFO L226 Difference]: Without dead ends: 1655 [2020-09-21 11:28:01,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-09-21 11:28:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2020-09-21 11:28:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1641. [2020-09-21 11:28:01,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2020-09-21 11:28:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2054 transitions. [2020-09-21 11:28:01,964 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2054 transitions. Word has length 140 [2020-09-21 11:28:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:01,964 INFO L479 AbstractCegarLoop]: Abstraction has 1641 states and 2054 transitions. [2020-09-21 11:28:01,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 11:28:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2054 transitions. [2020-09-21 11:28:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-09-21 11:28:01,967 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:01,968 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-21 11:28:01,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 11:28:01,968 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1059967410, now seen corresponding path program 1 times [2020-09-21 11:28:01,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:01,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [368406235] [2020-09-21 11:28:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:02,085 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:02,085 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:02,085 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:02,085 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:02,086 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 168 [2020-09-21 11:28:02,086 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:02,086 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 20 [2020-09-21 11:28:02,086 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:02,086 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 8 [2020-09-21 11:28:02,087 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:28:02,087 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 161 [2020-09-21 11:28:02,087 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:02,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:02,171 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:02,171 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:02,171 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:02,171 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:02,172 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:02,172 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:02,172 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-09-21 11:28:02,172 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:02,172 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:02,173 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:02,173 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:28:02,173 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:02,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:28:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:02,227 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:02,228 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:02,228 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:02,228 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:02,228 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 136 [2020-09-21 11:28:02,229 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:02,229 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-09-21 11:28:02,229 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:02,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:02,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:02,229 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 129 [2020-09-21 11:28:02,230 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-21 11:28:02,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [368406235] [2020-09-21 11:28:02,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:28:02,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 11:28:02,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378975936] [2020-09-21 11:28:02,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 11:28:02,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:02,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 11:28:02,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 11:28:02,304 INFO L87 Difference]: Start difference. First operand 1641 states and 2054 transitions. Second operand 5 states. [2020-09-21 11:28:03,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:03,485 INFO L93 Difference]: Finished difference Result 2237 states and 2876 transitions. [2020-09-21 11:28:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 11:28:03,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2020-09-21 11:28:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:03,504 INFO L225 Difference]: With dead ends: 2237 [2020-09-21 11:28:03,504 INFO L226 Difference]: Without dead ends: 2235 [2020-09-21 11:28:03,506 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 11:28:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2020-09-21 11:28:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 1645. [2020-09-21 11:28:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1645 states. [2020-09-21 11:28:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2064 transitions. [2020-09-21 11:28:03,578 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2064 transitions. Word has length 157 [2020-09-21 11:28:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:03,579 INFO L479 AbstractCegarLoop]: Abstraction has 1645 states and 2064 transitions. [2020-09-21 11:28:03,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 11:28:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2064 transitions. [2020-09-21 11:28:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2020-09-21 11:28:03,584 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:03,584 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2020-09-21 11:28:03,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 11:28:03,585 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:03,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2040878078, now seen corresponding path program 1 times [2020-09-21 11:28:03,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:03,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1434844826] [2020-09-21 11:28:03,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 11:28:03,677 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 11:28:03,677 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 11:28:03,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 11:28:03,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 11:28:03 BoogieIcfgContainer [2020-09-21 11:28:03,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 11:28:03,760 INFO L168 Benchmark]: Toolchain (without parser) took 15760.00 ms. Allocated memory was 138.4 MB in the beginning and 422.6 MB in the end (delta: 284.2 MB). Free memory was 99.2 MB in the beginning and 339.3 MB in the end (delta: -240.1 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:03,761 INFO L168 Benchmark]: CDTParser took 0.92 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 11:28:03,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.04 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 98.5 MB in the beginning and 171.4 MB in the end (delta: -72.9 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:03,772 INFO L168 Benchmark]: Boogie Preprocessor took 118.20 ms. Allocated memory is still 205.0 MB. Free memory was 171.4 MB in the beginning and 167.1 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:03,773 INFO L168 Benchmark]: RCFGBuilder took 1487.16 ms. Allocated memory was 205.0 MB in the beginning and 236.5 MB in the end (delta: 31.5 MB). Free memory was 166.4 MB in the beginning and 181.9 MB in the end (delta: -15.5 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:03,774 INFO L168 Benchmark]: TraceAbstraction took 13345.32 ms. Allocated memory was 236.5 MB in the beginning and 422.6 MB in the end (delta: 186.1 MB). Free memory was 181.9 MB in the beginning and 339.3 MB in the end (delta: -157.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:03,791 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.92 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.04 ms. Allocated memory was 138.4 MB in the beginning and 205.0 MB in the end (delta: 66.6 MB). Free memory was 98.5 MB in the beginning and 171.4 MB in the end (delta: -72.9 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.20 ms. Allocated memory is still 205.0 MB. Free memory was 171.4 MB in the beginning and 167.1 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1487.16 ms. Allocated memory was 205.0 MB in the beginning and 236.5 MB in the end (delta: 31.5 MB). Free memory was 166.4 MB in the beginning and 181.9 MB in the end (delta: -15.5 MB). Peak memory consumption was 84.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13345.32 ms. Allocated memory was 236.5 MB in the beginning and 422.6 MB in the end (delta: 186.1 MB). Free memory was 181.9 MB in the beginning and 339.3 MB in the end (delta: -157.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] return 22; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L55] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.1s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 141 SDtfs, 3027 SDslu, 187 SDs, 0 SdLazy, 4720 SolverSat, 964 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1645occurred 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.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 666 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 847 NumberOfCodeBlocks, 847 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 636 ConstructedInterpolants, 0 QuantifiedInterpolants, 196807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 78/80 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...