/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_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 11:27:56,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 11:27:56,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 11:27:56,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 11:27:56,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 11:27:56,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 11:27:56,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 11:27:56,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 11:27:56,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 11:27:56,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 11:27:56,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 11:27:56,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 11:27:56,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 11:27:56,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 11:27:56,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 11:27:56,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 11:27:56,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 11:27:57,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 11:27:57,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 11:27:57,011 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 11:27:57,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 11:27:57,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 11:27:57,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 11:27:57,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 11:27:57,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 11:27:57,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 11:27:57,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 11:27:57,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 11:27:57,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 11:27:57,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 11:27:57,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 11:27:57,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 11:27:57,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 11:27:57,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 11:27:57,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 11:27:57,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 11:27:57,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 11:27:57,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 11:27:57,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 11:27:57,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 11:27:57,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 11:27:57,032 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:57,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 11:27:57,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 11:27:57,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 11:27:57,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 11:27:57,061 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 11:27:57,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 11:27:57,061 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 11:27:57,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 11:27:57,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 11:27:57,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 11:27:57,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 11:27:57,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 11:27:57,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 11:27:57,063 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 11:27:57,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 11:27:57,063 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 11:27:57,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 11:27:57,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 11:27:57,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 11:27:57,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 11:27:57,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 11:27:57,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 11:27:57,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 11:27:57,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 11:27:57,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 11:27:57,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 11:27:57,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 11:27:57,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 11:27:57,066 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 11:27:57,066 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:57,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 11:27:57,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 11:27:57,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 11:27:57,537 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 11:27:57,538 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 11:27:57,540 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-21 11:27:57,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7b8fa6ffd/f24db32658034eebb6ba48a770d48cfb/FLAG3b878651b [2020-09-21 11:27:58,306 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 11:27:58,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label55.c [2020-09-21 11:27:58,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7b8fa6ffd/f24db32658034eebb6ba48a770d48cfb/FLAG3b878651b [2020-09-21 11:27:58,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7b8fa6ffd/f24db32658034eebb6ba48a770d48cfb [2020-09-21 11:27:58,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 11:27:58,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 11:27:58,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 11:27:58,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 11:27:58,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 11:27:58,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:27:58" (1/1) ... [2020-09-21 11:27:58,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbac012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:58, skipping insertion in model container [2020-09-21 11:27:58,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:27:58" (1/1) ... [2020-09-21 11:27:58,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 11:27:58,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 11:27:59,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 11:27:59,253 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 11:27:59,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 11:27:59,414 INFO L208 MainTranslator]: Completed translation [2020-09-21 11:27:59,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:59 WrapperNode [2020-09-21 11:27:59,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 11:27:59,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 11:27:59,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 11:27:59,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 11:27:59,431 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:59" (1/1) ... [2020-09-21 11:27:59,432 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:59" (1/1) ... [2020-09-21 11:27:59,451 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:59" (1/1) ... [2020-09-21 11:27:59,451 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:59" (1/1) ... [2020-09-21 11:27:59,497 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:59" (1/1) ... [2020-09-21 11:27:59,511 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:59" (1/1) ... [2020-09-21 11:27:59,518 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:59" (1/1) ... [2020-09-21 11:27:59,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 11:27:59,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 11:27:59,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 11:27:59,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 11:27:59,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:59" (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:59,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 11:27:59,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 11:27:59,608 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 11:27:59,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 11:27:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 11:27:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 11:27:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 11:27:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 11:27:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 11:27:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 11:27:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 11:28:01,115 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 11:28:01,115 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 11:28:01,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:28:01 BoogieIcfgContainer [2020-09-21 11:28:01,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 11:28:01,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 11:28:01,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 11:28:01,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 11:28:01,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:27:58" (1/3) ... [2020-09-21 11:28:01,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fea01ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:28:01, skipping insertion in model container [2020-09-21 11:28:01,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:27:59" (2/3) ... [2020-09-21 11:28:01,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fea01ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:28:01, skipping insertion in model container [2020-09-21 11:28:01,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:28:01" (3/3) ... [2020-09-21 11:28:01,143 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label55.c [2020-09-21 11:28:01,160 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 11:28:01,177 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 11:28:01,208 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 11:28:01,261 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 11:28:01,262 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 11:28:01,262 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 11:28:01,263 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 11:28:01,263 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 11:28:01,263 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 11:28:01,263 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 11:28:01,264 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 11:28:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-09-21 11:28:01,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-21 11:28:01,322 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:01,324 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 11:28:01,325 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1305395761, now seen corresponding path program 1 times [2020-09-21 11:28:01,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:01,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039898873] [2020-09-21 11:28:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:01,693 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:01,693 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:01,694 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:01,694 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:01,694 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 33 [2020-09-21 11:28:01,694 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:01,694 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 93 [2020-09-21 11:28:01,695 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:01,695 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:28:01,695 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:28:01,695 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-09-21 11:28:01,696 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:28:01,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:01,847 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:01,848 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:01,848 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:01,849 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:01,849 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:01,849 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:01,849 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 11:28:01,849 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:01,850 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:01,850 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:01,850 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:28:01,850 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:28:01,878 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:28:01,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039898873] [2020-09-21 11:28:01,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:28:01,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-21 11:28:01,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866829465] [2020-09-21 11:28:01,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 11:28:01,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:01,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 11:28:01,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 11:28:01,911 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 5 states. [2020-09-21 11:28:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:04,092 INFO L93 Difference]: Finished difference Result 730 states and 1301 transitions. [2020-09-21 11:28:04,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 11:28:04,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-09-21 11:28:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:04,143 INFO L225 Difference]: With dead ends: 730 [2020-09-21 11:28:04,143 INFO L226 Difference]: Without dead ends: 447 [2020-09-21 11:28:04,156 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-21 11:28:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-09-21 11:28:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 441. [2020-09-21 11:28:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-09-21 11:28:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 672 transitions. [2020-09-21 11:28:04,299 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 672 transitions. Word has length 24 [2020-09-21 11:28:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:04,299 INFO L479 AbstractCegarLoop]: Abstraction has 441 states and 672 transitions. [2020-09-21 11:28:04,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 11:28:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 672 transitions. [2020-09-21 11:28:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 11:28:04,306 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:04,306 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 11:28:04,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 11:28:04,307 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash 853278169, now seen corresponding path program 1 times [2020-09-21 11:28:04,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:04,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1759520770] [2020-09-21 11:28:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:04,574 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:04,574 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:04,575 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:04,575 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:04,575 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 108 [2020-09-21 11:28:04,575 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:04,578 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 183 [2020-09-21 11:28:04,579 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:04,579 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:28:04,579 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:28:04,579 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 79 [2020-09-21 11:28:04,579 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:04,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:04,685 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:04,685 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:04,686 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:04,686 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:04,686 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:04,686 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:04,687 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-09-21 11:28:04,687 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:04,687 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:04,687 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:04,687 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:28:04,688 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:04,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:28:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:04,788 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:04,789 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:04,789 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:04,789 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:04,790 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-21 11:28:04,790 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:04,790 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 57 [2020-09-21 11:28:04,790 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:04,790 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:04,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:28:04,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 11:28:04,791 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:28:04,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1759520770] [2020-09-21 11:28:04,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:28:04,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 11:28:04,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150847783] [2020-09-21 11:28:04,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 11:28:04,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:04,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 11:28:04,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 11:28:04,877 INFO L87 Difference]: Start difference. First operand 441 states and 672 transitions. Second operand 8 states. [2020-09-21 11:28:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:06,716 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2020-09-21 11:28:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 11:28:06,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2020-09-21 11:28:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:06,721 INFO L225 Difference]: With dead ends: 1041 [2020-09-21 11:28:06,721 INFO L226 Difference]: Without dead ends: 606 [2020-09-21 11:28:06,723 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:28:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-09-21 11:28:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 592. [2020-09-21 11:28:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-09-21 11:28:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 829 transitions. [2020-09-21 11:28:06,764 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 829 transitions. Word has length 97 [2020-09-21 11:28:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:06,765 INFO L479 AbstractCegarLoop]: Abstraction has 592 states and 829 transitions. [2020-09-21 11:28:06,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 11:28:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 829 transitions. [2020-09-21 11:28:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-21 11:28:06,770 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:06,770 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 11:28:06,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 11:28:06,771 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:06,771 INFO L82 PathProgramCache]: Analyzing trace with hash -689374291, now seen corresponding path program 1 times [2020-09-21 11:28:06,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:06,772 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [953536478] [2020-09-21 11:28:06,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:06,852 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:06,853 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:06,853 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:06,853 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:06,853 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 114 [2020-09-21 11:28:06,854 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:06,854 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 27 [2020-09-21 11:28:06,854 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:06,854 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:06,855 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 90 [2020-09-21 11:28:06,855 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 23 [2020-09-21 11:28:06,855 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:06,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:06,931 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:06,933 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:06,933 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:06,933 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:06,933 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:06,934 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:06,934 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-09-21 11:28:06,934 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:06,934 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 11:28:06,935 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:06,935 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 11:28:06,935 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:06,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:28:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:06,994 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:06,994 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:06,994 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:06,995 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:06,995 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 81 [2020-09-21 11:28:06,995 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:06,995 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 11:28:06,996 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:06,996 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:06,996 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:06,997 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 11:28:06,997 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:28:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:28:07,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [953536478] [2020-09-21 11:28:07,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:28:07,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 11:28:07,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577205103] [2020-09-21 11:28:07,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 11:28:07,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 11:28:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 11:28:07,072 INFO L87 Difference]: Start difference. First operand 592 states and 829 transitions. Second operand 5 states. [2020-09-21 11:28:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:10,747 INFO L93 Difference]: Finished difference Result 1776 states and 2554 transitions. [2020-09-21 11:28:10,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 11:28:10,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2020-09-21 11:28:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:10,770 INFO L225 Difference]: With dead ends: 1776 [2020-09-21 11:28:10,771 INFO L226 Difference]: Without dead ends: 1190 [2020-09-21 11:28:10,774 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-09-21 11:28:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1035. [2020-09-21 11:28:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2020-09-21 11:28:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1373 transitions. [2020-09-21 11:28:10,877 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1373 transitions. Word has length 103 [2020-09-21 11:28:10,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:10,879 INFO L479 AbstractCegarLoop]: Abstraction has 1035 states and 1373 transitions. [2020-09-21 11:28:10,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 11:28:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1373 transitions. [2020-09-21 11:28:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-09-21 11:28:10,898 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:10,901 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 11:28:10,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 11:28:10,902 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:10,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1755559734, now seen corresponding path program 1 times [2020-09-21 11:28:10,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:10,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1489414511] [2020-09-21 11:28:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:10,987 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:10,988 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:10,988 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:10,988 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:10,989 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 125 [2020-09-21 11:28:10,998 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:10,998 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 20 [2020-09-21 11:28:11,002 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:11,002 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:28:11,003 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:28:11,003 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 96 [2020-09-21 11:28:11,003 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:28:11,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:11,142 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:11,142 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:11,142 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:11,142 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:11,143 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:11,143 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:11,143 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-09-21 11:28:11,143 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:11,144 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:11,144 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:11,144 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:28:11,144 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:11,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:28:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:11,221 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:11,221 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:11,223 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:11,223 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:11,224 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 92 [2020-09-21 11:28:11,224 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:11,225 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-09-21 11:28:11,225 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:11,225 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:11,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:28:11,226 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-09-21 11:28:11,227 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:28:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:28:11,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1489414511] [2020-09-21 11:28:11,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:28:11,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-21 11:28:11,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454463360] [2020-09-21 11:28:11,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 11:28:11,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:11,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 11:28:11,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 11:28:11,441 INFO L87 Difference]: Start difference. First operand 1035 states and 1373 transitions. Second operand 7 states. [2020-09-21 11:28:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:13,276 INFO L93 Difference]: Finished difference Result 2964 states and 4086 transitions. [2020-09-21 11:28:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 11:28:13,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-09-21 11:28:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:13,293 INFO L225 Difference]: With dead ends: 2964 [2020-09-21 11:28:13,295 INFO L226 Difference]: Without dead ends: 1935 [2020-09-21 11:28:13,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-21 11:28:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2020-09-21 11:28:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1490. [2020-09-21 11:28:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-09-21 11:28:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1986 transitions. [2020-09-21 11:28:13,385 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1986 transitions. Word has length 114 [2020-09-21 11:28:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:13,386 INFO L479 AbstractCegarLoop]: Abstraction has 1490 states and 1986 transitions. [2020-09-21 11:28:13,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 11:28:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1986 transitions. [2020-09-21 11:28:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-21 11:28:13,395 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:13,396 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 11:28:13,396 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:13,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:13,397 INFO L82 PathProgramCache]: Analyzing trace with hash -83786946, now seen corresponding path program 1 times [2020-09-21 11:28:13,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:13,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [600868506] [2020-09-21 11:28:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:13,496 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:13,496 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:13,496 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:13,497 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:13,497 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 147 [2020-09-21 11:28:13,497 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:13,497 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 34 [2020-09-21 11:28:13,497 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:13,498 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:28:13,498 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:28:13,498 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 118 [2020-09-21 11:28:13,498 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:13,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:13,573 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:13,574 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:13,574 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:13,574 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:13,574 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:13,575 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:13,576 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-09-21 11:28:13,576 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:13,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:13,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:13,576 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:28:13,576 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:13,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:28:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:13,645 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:13,646 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:13,646 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:13,646 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:13,646 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 114 [2020-09-21 11:28:13,647 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:13,647 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 13 [2020-09-21 11:28:13,647 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:13,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:13,647 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:28:13,648 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 113 [2020-09-21 11:28:13,648 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 11:28:13,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [600868506] [2020-09-21 11:28:13,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 11:28:13,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-21 11:28:13,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396747583] [2020-09-21 11:28:13,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 11:28:13,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 11:28:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-21 11:28:13,783 INFO L87 Difference]: Start difference. First operand 1490 states and 1986 transitions. Second operand 8 states. [2020-09-21 11:28:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:16,405 INFO L93 Difference]: Finished difference Result 3874 states and 5372 transitions. [2020-09-21 11:28:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 11:28:16,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2020-09-21 11:28:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:16,421 INFO L225 Difference]: With dead ends: 3874 [2020-09-21 11:28:16,422 INFO L226 Difference]: Without dead ends: 2390 [2020-09-21 11:28:16,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-09-21 11:28:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2020-09-21 11:28:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2086. [2020-09-21 11:28:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2020-09-21 11:28:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 2696 transitions. [2020-09-21 11:28:16,497 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 2696 transitions. Word has length 136 [2020-09-21 11:28:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:16,497 INFO L479 AbstractCegarLoop]: Abstraction has 2086 states and 2696 transitions. [2020-09-21 11:28:16,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 11:28:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2696 transitions. [2020-09-21 11:28:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2020-09-21 11:28:16,502 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:16,502 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 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] [2020-09-21 11:28:16,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 11:28:16,503 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1136439961, now seen corresponding path program 1 times [2020-09-21 11:28:16,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:16,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1398870832] [2020-09-21 11:28:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:16,638 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:16,639 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:16,639 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:16,639 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:16,639 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 223 [2020-09-21 11:28:16,639 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:16,640 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 89 [2020-09-21 11:28:16,640 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:16,640 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 11:28:16,640 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 11:28:16,640 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 102 [2020-09-21 11:28:16,641 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:16,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:16,741 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:16,742 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:16,742 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:16,742 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:16,743 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:16,743 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:16,743 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-09-21 11:28:16,744 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:16,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:16,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:16,744 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 11:28:16,745 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:28:16,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:28:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:16,842 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:16,843 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:16,843 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:16,843 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:16,844 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-09-21 11:28:16,844 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:16,844 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 46 [2020-09-21 11:28:16,844 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:16,844 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:16,845 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:28:16,845 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 97 [2020-09-21 11:28:16,845 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:16,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 11:28:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:16,962 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:16,963 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:16,963 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:16,963 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:16,963 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 92 [2020-09-21 11:28:16,963 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:16,964 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1 [2020-09-21 11:28:16,964 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:16,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 11:28:16,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-09-21 11:28:16,964 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 11:28:16,965 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 34 proven. 85 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-21 11:28:17,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1398870832] [2020-09-21 11:28:17,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:28:17,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 11:28:17,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819909348] [2020-09-21 11:28:17,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 11:28:17,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:17,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 11:28:17,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 11:28:17,042 INFO L87 Difference]: Start difference. First operand 2086 states and 2696 transitions. Second operand 7 states. [2020-09-21 11:28:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:18,849 INFO L93 Difference]: Finished difference Result 4323 states and 5595 transitions. [2020-09-21 11:28:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 11:28:18,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 210 [2020-09-21 11:28:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:18,860 INFO L225 Difference]: With dead ends: 4323 [2020-09-21 11:28:18,860 INFO L226 Difference]: Without dead ends: 2243 [2020-09-21 11:28:18,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 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:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2020-09-21 11:28:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2231. [2020-09-21 11:28:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2020-09-21 11:28:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2859 transitions. [2020-09-21 11:28:18,929 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2859 transitions. Word has length 210 [2020-09-21 11:28:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:18,930 INFO L479 AbstractCegarLoop]: Abstraction has 2231 states and 2859 transitions. [2020-09-21 11:28:18,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 11:28:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2859 transitions. [2020-09-21 11:28:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-09-21 11:28:18,935 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:18,935 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 11:28:18,936 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1177582321, now seen corresponding path program 1 times [2020-09-21 11:28:18,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:18,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1212397915] [2020-09-21 11:28:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:19,017 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:19,017 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:19,017 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:19,017 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:19,018 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 243 [2020-09-21 11:28:19,018 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:19,018 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-09-21 11:28:19,018 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:19,018 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:19,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 81 [2020-09-21 11:28:19,019 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-09-21 11:28:19,019 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:19,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:19,102 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:19,102 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:19,102 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:19,102 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:19,103 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:19,103 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:19,103 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1 [2020-09-21 11:28:19,103 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:19,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 11:28:19,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:19,104 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 11:28:19,104 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:19,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:28:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:19,135 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:19,136 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:19,136 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:19,136 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:19,136 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 72 [2020-09-21 11:28:19,136 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:19,137 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 11:28:19,137 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:19,137 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:19,137 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:19,138 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-09-21 11:28:19,138 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:19,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-21 11:28:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:19,210 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:19,210 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:19,210 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:19,212 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:19,212 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 138 [2020-09-21 11:28:19,213 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:19,213 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-21 11:28:19,214 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:19,214 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:19,214 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:28:19,215 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-09-21 11:28:19,215 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 11:28:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 11:28:19,503 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1212397915] [2020-09-21 11:28:19,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:28:19,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 11:28:19,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004253927] [2020-09-21 11:28:19,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 11:28:19,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 11:28:19,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-21 11:28:19,506 INFO L87 Difference]: Start difference. First operand 2231 states and 2859 transitions. Second operand 7 states. [2020-09-21 11:28:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:21,682 INFO L93 Difference]: Finished difference Result 4329 states and 5598 transitions. [2020-09-21 11:28:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 11:28:21,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 230 [2020-09-21 11:28:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:21,693 INFO L225 Difference]: With dead ends: 4329 [2020-09-21 11:28:21,693 INFO L226 Difference]: Without dead ends: 2247 [2020-09-21 11:28:21,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-09-21 11:28:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2020-09-21 11:28:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1802. [2020-09-21 11:28:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-09-21 11:28:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2180 transitions. [2020-09-21 11:28:21,756 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2180 transitions. Word has length 230 [2020-09-21 11:28:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:21,757 INFO L479 AbstractCegarLoop]: Abstraction has 1802 states and 2180 transitions. [2020-09-21 11:28:21,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 11:28:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2180 transitions. [2020-09-21 11:28:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2020-09-21 11:28:21,762 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:21,762 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 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:28:21,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 11:28:21,763 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:21,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:21,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1643123341, now seen corresponding path program 1 times [2020-09-21 11:28:21,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:21,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1993164299] [2020-09-21 11:28:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:21,857 FATAL L256 erpolLogProxyWrapper]: Difference in size: 5 [2020-09-21 11:28:21,857 FATAL L256 erpolLogProxyWrapper]: Difference in depth: -84 [2020-09-21 11:28:21,858 FATAL L256 erpolLogProxyWrapper]: Difference in width: 84 [2020-09-21 11:28:21,858 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:21,858 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 257 [2020-09-21 11:28:21,858 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:21,858 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 21 [2020-09-21 11:28:21,859 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:21,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:21,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 90 [2020-09-21 11:28:21,859 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-09-21 11:28:21,859 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:21,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 11:28:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:21,964 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:21,965 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:21,965 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:21,965 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:21,966 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 11:28:21,966 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:21,966 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1 [2020-09-21 11:28:21,966 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:21,966 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 11:28:21,967 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:21,967 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 11:28:21,967 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:21,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 11:28:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:22,006 FATAL L256 erpolLogProxyWrapper]: Difference in size: 1 [2020-09-21 11:28:22,006 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:22,006 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:22,007 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:22,007 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 81 [2020-09-21 11:28:22,007 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:22,007 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-21 11:28:22,008 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:22,008 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 11:28:22,008 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 11:28:22,008 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 11:28:22,008 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:22,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-21 11:28:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 11:28:22,111 FATAL L256 erpolLogProxyWrapper]: Difference in size: 0 [2020-09-21 11:28:22,111 FATAL L256 erpolLogProxyWrapper]: Difference in depth: 0 [2020-09-21 11:28:22,111 FATAL L256 erpolLogProxyWrapper]: Difference in width: 0 [2020-09-21 11:28:22,112 FATAL L256 erpolLogProxyWrapper]: Timeout: Unlimited (no timeout set) [2020-09-21 11:28:22,112 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-09-21 11:28:22,112 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 11:28:22,112 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-09-21 11:28:22,113 FATAL L256 erpolLogProxyWrapper]: Heuristic: FIRST [2020-09-21 11:28:22,113 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 11:28:22,113 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 11:28:22,113 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-09-21 11:28:22,113 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 11:28:22,365 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 11:28:22,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1993164299] [2020-09-21 11:28:22,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 11:28:22,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 11:28:22,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238374752] [2020-09-21 11:28:22,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 11:28:22,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 11:28:22,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 11:28:22,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 11:28:22,368 INFO L87 Difference]: Start difference. First operand 1802 states and 2180 transitions. Second operand 7 states. [2020-09-21 11:28:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 11:28:24,297 INFO L93 Difference]: Finished difference Result 4203 states and 5156 transitions. [2020-09-21 11:28:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 11:28:24,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2020-09-21 11:28:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 11:28:24,308 INFO L225 Difference]: With dead ends: 4203 [2020-09-21 11:28:24,308 INFO L226 Difference]: Without dead ends: 2527 [2020-09-21 11:28:24,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-21 11:28:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2020-09-21 11:28:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 1802. [2020-09-21 11:28:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-09-21 11:28:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2173 transitions. [2020-09-21 11:28:24,378 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2173 transitions. Word has length 244 [2020-09-21 11:28:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 11:28:24,379 INFO L479 AbstractCegarLoop]: Abstraction has 1802 states and 2173 transitions. [2020-09-21 11:28:24,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 11:28:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2173 transitions. [2020-09-21 11:28:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2020-09-21 11:28:24,444 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 11:28:24,444 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 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] [2020-09-21 11:28:24,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 11:28:24,445 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 11:28:24,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 11:28:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1637300869, now seen corresponding path program 1 times [2020-09-21 11:28:24,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 11:28:24,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [60639326] [2020-09-21 11:28:24,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 11:28:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 11:28:24,544 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 11:28:24,544 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 11:28:24,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 11:28:24,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 11:28:24 BoogieIcfgContainer [2020-09-21 11:28:24,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 11:28:24,664 INFO L168 Benchmark]: Toolchain (without parser) took 26107.90 ms. Allocated memory was 140.5 MB in the beginning and 507.5 MB in the end (delta: 367.0 MB). Free memory was 101.6 MB in the beginning and 436.4 MB in the end (delta: -334.8 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:24,670 INFO L168 Benchmark]: CDTParser took 0.84 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 11:28:24,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.25 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 171.7 MB in the end (delta: -70.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:24,675 INFO L168 Benchmark]: Boogie Preprocessor took 113.12 ms. Allocated memory is still 205.5 MB. Free memory was 171.7 MB in the beginning and 166.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:24,676 INFO L168 Benchmark]: RCFGBuilder took 1598.36 ms. Allocated memory was 205.5 MB in the beginning and 237.0 MB in the end (delta: 31.5 MB). Free memory was 166.9 MB in the beginning and 178.8 MB in the end (delta: -11.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:24,682 INFO L168 Benchmark]: TraceAbstraction took 23521.58 ms. Allocated memory was 237.0 MB in the beginning and 507.5 MB in the end (delta: 270.5 MB). Free memory was 178.8 MB in the beginning and 436.4 MB in the end (delta: -257.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-09-21 11:28:24,685 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.84 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 864.25 ms. Allocated memory was 140.5 MB in the beginning and 205.5 MB in the end (delta: 65.0 MB). Free memory was 101.0 MB in the beginning and 171.7 MB in the end (delta: -70.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.12 ms. Allocated memory is still 205.5 MB. Free memory was 171.7 MB in the beginning and 166.9 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1598.36 ms. Allocated memory was 205.5 MB in the beginning and 237.0 MB in the end (delta: 31.5 MB). Free memory was 166.9 MB in the beginning and 178.8 MB in the end (delta: -11.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23521.58 ms. Allocated memory was 237.0 MB in the beginning and 507.5 MB in the end (delta: 270.5 MB). Free memory was 178.8 MB in the beginning and 436.4 MB in the end (delta: -257.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 58]: 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 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 FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [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 FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) [L487] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) [L493] COND FALSE !(((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0))) [L499] COND FALSE !((((a4==14) && ((a19==9) && ((input == 2) && (((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 ))))) && (a12==0))) [L504] COND FALSE !((((a4==14) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 2))) && (a12==0))) && (a10==4))) [L509] COND FALSE !(((a4==14) && (((a19==9) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 6)) && (a10==3))) && (a12==0)))) [L514] COND FALSE !((((a4==14) && ((((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a12==0))) && (a10==0))) [L517] COND FALSE !(((a12==0) && ((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 2)) && (a19==10))))) [L523] COND FALSE !((((a12==0) && ((a19==9) && ((a10==2) && ((input == 6) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))))) && (a4==14))) [L526] COND FALSE !(((a4==14) && ((a19==9) && ((a12==0) && (((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)))))) [L529] COND FALSE !(((a19==9) && (((a10==1) && ((a12==0) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a4==14)))) [L534] COND FALSE !(((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0)))))) [L540] COND FALSE !(((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0)))) [L545] COND FALSE !(((a4==14) && (((a12==0) && ((a19==9) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )))) && (a10==4)))) [L548] COND FALSE !(((((( ((38 < a1) && (218 >= a1)) && (input == 3)) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10))) [L554] COND FALSE !((((a4==14) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 4)) && (a12==0)) && (a19==9))) && (a10==2))) [L557] COND TRUE ((a12==0) && ((( 218 < a1 && ((a19==9) && (input == 5))) && (a10==1)) && (a4==14))) [L558] a1 = ((((a1 * 9)/ 10) + 58620) - 603783) [L559] a10 = 4 [L560] a19 = 8 [L562] 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 FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L58] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.3s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 211 SDtfs, 3468 SDslu, 307 SDs, 0 SdLazy, 7932 SolverSat, 1253 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred 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.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 2106 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1438 NumberOfCodeBlocks, 1438 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1150 ConstructedInterpolants, 0 QuantifiedInterpolants, 648354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 319/409 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...