/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 --rcfgbuilder.size.of.a.code.block SequenceOfStatements --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 enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.4 --traceabstraction.additional.smt.options log-additional-information=true --traceabstraction.additional.smt.options unknown-allowed=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label47.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-adbd35c [2020-10-14 02:31:32,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-14 02:31:32,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-14 02:31:32,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-14 02:31:32,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-14 02:31:32,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-14 02:31:32,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-14 02:31:32,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-14 02:31:32,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-14 02:31:32,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-14 02:31:32,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-14 02:31:32,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-14 02:31:32,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-14 02:31:32,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-14 02:31:32,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-14 02:31:32,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-14 02:31:32,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-14 02:31:32,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-14 02:31:32,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-14 02:31:32,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-14 02:31:32,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-14 02:31:32,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-14 02:31:32,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-14 02:31:32,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-14 02:31:32,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-14 02:31:32,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-14 02:31:32,969 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-14 02:31:32,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-14 02:31:32,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-14 02:31:32,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-14 02:31:32,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-14 02:31:32,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-14 02:31:32,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-14 02:31:32,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-14 02:31:32,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-14 02:31:32,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-14 02:31:32,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-14 02:31:32,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-14 02:31:32,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-14 02:31:32,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-14 02:31:32,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-14 02:31:32,981 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-10-14 02:31:33,021 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-14 02:31:33,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-14 02:31:33,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-14 02:31:33,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-14 02:31:33,024 INFO L138 SettingsManager]: * Use SBE=true [2020-10-14 02:31:33,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-14 02:31:33,025 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-14 02:31:33,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-14 02:31:33,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-14 02:31:33,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-14 02:31:33,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-14 02:31:33,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-14 02:31:33,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-14 02:31:33,027 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-14 02:31:33,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-14 02:31:33,028 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-14 02:31:33,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-14 02:31:33,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-14 02:31:33,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-14 02:31:33,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-14 02:31:33,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-14 02:31:33,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-14 02:31:33,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-14 02:31:33,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-14 02:31:33,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-14 02:31:33,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-14 02:31:33,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-14 02:31:33,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-14 02:31:33,030 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-14 02:31:33,030 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.rcfgbuilder: Size of a code block -> SequenceOfStatements 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;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4;log-additional-information=true;unknown-allowed=true; [2020-10-14 02:31:33,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-14 02:31:33,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-14 02:31:33,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-14 02:31:33,347 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-14 02:31:33,347 INFO L275 PluginConnector]: CDTParser initialized [2020-10-14 02:31:33,348 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label47.c [2020-10-14 02:31:33,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7bb5717d4/fac74e6ec9ec4d50ba2e50ce90136a64/FLAG94dea952d [2020-10-14 02:31:33,996 INFO L306 CDTParser]: Found 1 translation units. [2020-10-14 02:31:33,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label47.c [2020-10-14 02:31:34,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7bb5717d4/fac74e6ec9ec4d50ba2e50ce90136a64/FLAG94dea952d [2020-10-14 02:31:34,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7bb5717d4/fac74e6ec9ec4d50ba2e50ce90136a64 [2020-10-14 02:31:34,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-14 02:31:34,281 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-14 02:31:34,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-14 02:31:34,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-14 02:31:34,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-14 02:31:34,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:31:34" (1/1) ... [2020-10-14 02:31:34,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22b6b276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:34, skipping insertion in model container [2020-10-14 02:31:34,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:31:34" (1/1) ... [2020-10-14 02:31:34,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-14 02:31:34,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-14 02:31:34,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:31:34,770 INFO L203 MainTranslator]: Completed pre-run [2020-10-14 02:31:35,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-14 02:31:35,062 INFO L208 MainTranslator]: Completed translation [2020-10-14 02:31:35,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35 WrapperNode [2020-10-14 02:31:35,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-14 02:31:35,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-14 02:31:35,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-14 02:31:35,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-14 02:31:35,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35" (1/1) ... [2020-10-14 02:31:35,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35" (1/1) ... [2020-10-14 02:31:35,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35" (1/1) ... [2020-10-14 02:31:35,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35" (1/1) ... [2020-10-14 02:31:35,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35" (1/1) ... [2020-10-14 02:31:35,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35" (1/1) ... [2020-10-14 02:31:35,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35" (1/1) ... [2020-10-14 02:31:35,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-14 02:31:35,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-14 02:31:35,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-14 02:31:35,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-14 02:31:35,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35" (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-10-14 02:31:35,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-14 02:31:35,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-14 02:31:35,250 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-10-14 02:31:35,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-14 02:31:35,250 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-10-14 02:31:35,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-10-14 02:31:35,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-14 02:31:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-14 02:31:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-14 02:31:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-14 02:31:35,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-14 02:31:36,510 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-14 02:31:36,510 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-14 02:31:36,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:31:36 BoogieIcfgContainer [2020-10-14 02:31:36,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-14 02:31:36,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-14 02:31:36,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-14 02:31:36,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-14 02:31:36,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:31:34" (1/3) ... [2020-10-14 02:31:36,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbd90e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:31:36, skipping insertion in model container [2020-10-14 02:31:36,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:31:35" (2/3) ... [2020-10-14 02:31:36,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbd90e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:31:36, skipping insertion in model container [2020-10-14 02:31:36,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:31:36" (3/3) ... [2020-10-14 02:31:36,529 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label47.c [2020-10-14 02:31:36,542 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-14 02:31:36,553 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-14 02:31:36,571 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-14 02:31:36,604 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-14 02:31:36,605 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-14 02:31:36,605 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-14 02:31:36,605 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-14 02:31:36,605 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-14 02:31:36,606 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-14 02:31:36,606 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-14 02:31:36,606 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-14 02:31:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-10-14 02:31:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-14 02:31:36,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:36,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:31:36,646 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1812558786, now seen corresponding path program 1 times [2020-10-14 02:31:36,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:36,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [506705433] [2020-10-14 02:31:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:36,882 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:37,227 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:37,228 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 33 [2020-10-14 02:31:37,228 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:37,228 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 389 [2020-10-14 02:31:37,230 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:37,231 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:37,231 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:31:37,231 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:31:37,231 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 27 [2020-10-14 02:31:37,231 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 3 [2020-10-14 02:31:37,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:37,344 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:37,352 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:37,352 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:37,352 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:37,353 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-10-14 02:31:37,353 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:37,353 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:37,353 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:37,354 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:37,354 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:31:37,354 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 02:31:37,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [506705433] [2020-10-14 02:31:37,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 02:31:37,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-14 02:31:37,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349523410] [2020-10-14 02:31:37,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-14 02:31:37,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-14 02:31:37,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-14 02:31:37,396 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-10-14 02:31:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:38,904 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2020-10-14 02:31:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:31:38,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-14 02:31:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:38,923 INFO L225 Difference]: With dead ends: 581 [2020-10-14 02:31:38,923 INFO L226 Difference]: Without dead ends: 302 [2020-10-14 02:31:38,930 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:31:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-14 02:31:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2020-10-14 02:31:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-14 02:31:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 448 transitions. [2020-10-14 02:31:39,010 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 448 transitions. Word has length 25 [2020-10-14 02:31:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:39,011 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 448 transitions. [2020-10-14 02:31:39,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-14 02:31:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 448 transitions. [2020-10-14 02:31:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-14 02:31:39,016 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:39,016 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:31:39,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-14 02:31:39,017 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:39,017 INFO L82 PathProgramCache]: Analyzing trace with hash -426991595, now seen corresponding path program 1 times [2020-10-14 02:31:39,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:39,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812883425] [2020-10-14 02:31:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:39,084 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:39,183 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:39,717 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:40,245 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:40,245 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 108 [2020-10-14 02:31:40,245 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:31:40,246 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1185 [2020-10-14 02:31:40,247 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:40,247 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:40,247 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:40,247 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 83 [2020-10-14 02:31:40,248 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 24 [2020-10-14 02:31:40,248 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 02:31:40,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:40,323 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:40,327 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:40,327 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:40,328 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:40,328 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-14 02:31:40,328 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:40,329 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:40,329 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:40,329 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:40,329 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:40,330 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:40,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:40,373 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:40,429 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:40,430 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-10-14 02:31:40,430 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:40,430 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 67 [2020-10-14 02:31:40,430 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:40,431 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:40,431 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:40,431 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:40,431 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 68 [2020-10-14 02:31:40,432 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 02:31:40,473 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812883425] [2020-10-14 02:31:40,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:40,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:31:40,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644282893] [2020-10-14 02:31:40,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:31:40,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:40,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:31:40,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:31:40,477 INFO L87 Difference]: Start difference. First operand 296 states and 448 transitions. Second operand 5 states. [2020-10-14 02:31:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:41,650 INFO L93 Difference]: Finished difference Result 594 states and 914 transitions. [2020-10-14 02:31:41,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:31:41,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-10-14 02:31:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:41,656 INFO L225 Difference]: With dead ends: 594 [2020-10-14 02:31:41,657 INFO L226 Difference]: Without dead ends: 592 [2020-10-14 02:31:41,658 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-10-14 02:31:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-10-14 02:31:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 586. [2020-10-14 02:31:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-10-14 02:31:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 898 transitions. [2020-10-14 02:31:41,712 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 898 transitions. Word has length 98 [2020-10-14 02:31:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:41,713 INFO L479 AbstractCegarLoop]: Abstraction has 586 states and 898 transitions. [2020-10-14 02:31:41,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:31:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 898 transitions. [2020-10-14 02:31:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-10-14 02:31:41,718 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:41,718 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:31:41,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-14 02:31:41,719 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:41,719 INFO L82 PathProgramCache]: Analyzing trace with hash 952937661, now seen corresponding path program 1 times [2020-10-14 02:31:41,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:41,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1306777542] [2020-10-14 02:31:41,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:41,791 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:42,007 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:42,367 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:42,660 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:42,660 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 160 [2020-10-14 02:31:42,660 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:31:42,660 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 895 [2020-10-14 02:31:42,661 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:42,661 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:42,661 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:42,661 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 135 [2020-10-14 02:31:42,661 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 24 [2020-10-14 02:31:42,662 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:42,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:42,741 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:42,744 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:42,744 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:42,745 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:42,745 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-10-14 02:31:42,745 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:42,745 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:42,747 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:42,747 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:42,748 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:42,748 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-10-14 02:31:42,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:42,820 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:42,951 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:42,951 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 126 [2020-10-14 02:31:42,951 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:42,952 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 147 [2020-10-14 02:31:42,952 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:42,952 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:42,952 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:42,953 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:42,953 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 120 [2020-10-14 02:31:42,953 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 02:31:43,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1306777542] [2020-10-14 02:31:43,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:43,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:31:43,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59933614] [2020-10-14 02:31:43,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:31:43,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:43,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:31:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:31:43,044 INFO L87 Difference]: Start difference. First operand 586 states and 898 transitions. Second operand 5 states. [2020-10-14 02:31:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:44,368 INFO L93 Difference]: Finished difference Result 1756 states and 2764 transitions. [2020-10-14 02:31:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:31:44,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2020-10-14 02:31:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:44,389 INFO L225 Difference]: With dead ends: 1756 [2020-10-14 02:31:44,389 INFO L226 Difference]: Without dead ends: 1176 [2020-10-14 02:31:44,394 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-10-14 02:31:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-10-14 02:31:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 878. [2020-10-14 02:31:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-10-14 02:31:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1242 transitions. [2020-10-14 02:31:44,494 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1242 transitions. Word has length 150 [2020-10-14 02:31:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:44,495 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1242 transitions. [2020-10-14 02:31:44,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:31:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1242 transitions. [2020-10-14 02:31:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-10-14 02:31:44,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:44,509 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:31:44,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-14 02:31:44,513 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:44,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:44,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1118105046, now seen corresponding path program 1 times [2020-10-14 02:31:44,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:44,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160312959] [2020-10-14 02:31:44,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:44,591 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:44,777 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:45,081 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:45,535 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:45,536 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 161 [2020-10-14 02:31:45,536 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:31:45,536 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 970 [2020-10-14 02:31:45,536 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:45,537 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:45,537 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:45,537 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 136 [2020-10-14 02:31:45,537 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 24 [2020-10-14 02:31:45,537 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:45,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:45,592 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:45,594 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:45,595 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:45,595 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:45,595 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:31:45,595 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:45,596 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:45,596 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:45,596 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:45,596 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:45,597 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:45,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:45,651 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:45,751 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:45,751 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-10-14 02:31:45,751 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:45,751 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 116 [2020-10-14 02:31:45,752 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:45,752 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:45,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:45,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:45,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 121 [2020-10-14 02:31:45,753 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 02:31:45,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160312959] [2020-10-14 02:31:45,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:45,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-14 02:31:45,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639401187] [2020-10-14 02:31:45,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-14 02:31:45,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:45,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-14 02:31:45,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-14 02:31:45,832 INFO L87 Difference]: Start difference. First operand 878 states and 1242 transitions. Second operand 5 states. [2020-10-14 02:31:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:47,080 INFO L93 Difference]: Finished difference Result 2195 states and 3145 transitions. [2020-10-14 02:31:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-14 02:31:47,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2020-10-14 02:31:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:47,090 INFO L225 Difference]: With dead ends: 2195 [2020-10-14 02:31:47,091 INFO L226 Difference]: Without dead ends: 888 [2020-10-14 02:31:47,097 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-10-14 02:31:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2020-10-14 02:31:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 878. [2020-10-14 02:31:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-10-14 02:31:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1228 transitions. [2020-10-14 02:31:47,151 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1228 transitions. Word has length 151 [2020-10-14 02:31:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:47,154 INFO L479 AbstractCegarLoop]: Abstraction has 878 states and 1228 transitions. [2020-10-14 02:31:47,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-14 02:31:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1228 transitions. [2020-10-14 02:31:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-10-14 02:31:47,158 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:47,158 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:31:47,158 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-14 02:31:47,158 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:47,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1232749154, now seen corresponding path program 1 times [2020-10-14 02:31:47,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:47,159 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255190182] [2020-10-14 02:31:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:47,222 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:47,490 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:47,490 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 171 [2020-10-14 02:31:47,490 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:47,490 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 289 [2020-10-14 02:31:47,491 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:47,491 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:47,491 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-10-14 02:31:47,491 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 5 [2020-10-14 02:31:47,491 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 142 [2020-10-14 02:31:47,492 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:47,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:47,536 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:47,541 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:47,542 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:47,542 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:47,542 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 7 [2020-10-14 02:31:47,542 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:47,543 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:47,543 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:47,543 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:47,543 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-10-14 02:31:47,543 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:47,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:47,600 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:47,788 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:47,788 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-14 02:31:47,789 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:47,789 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 204 [2020-10-14 02:31:47,789 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:47,790 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:47,790 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:47,790 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:47,791 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-14 02:31:47,791 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-14 02:31:47,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255190182] [2020-10-14 02:31:47,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-14 02:31:47,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-14 02:31:47,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362546667] [2020-10-14 02:31:47,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:47,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:47,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:47,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:47,926 INFO L87 Difference]: Start difference. First operand 878 states and 1228 transitions. Second operand 7 states. [2020-10-14 02:31:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:49,276 INFO L93 Difference]: Finished difference Result 2235 states and 3322 transitions. [2020-10-14 02:31:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:31:49,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2020-10-14 02:31:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:49,286 INFO L225 Difference]: With dead ends: 2235 [2020-10-14 02:31:49,286 INFO L226 Difference]: Without dead ends: 1363 [2020-10-14 02:31:49,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:31:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-10-14 02:31:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 743. [2020-10-14 02:31:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2020-10-14 02:31:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 958 transitions. [2020-10-14 02:31:49,326 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 958 transitions. Word has length 161 [2020-10-14 02:31:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:49,326 INFO L479 AbstractCegarLoop]: Abstraction has 743 states and 958 transitions. [2020-10-14 02:31:49,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 958 transitions. [2020-10-14 02:31:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-10-14 02:31:49,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:49,331 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:31:49,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-14 02:31:49,332 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:49,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:49,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1548683930, now seen corresponding path program 1 times [2020-10-14 02:31:49,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:49,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127143747] [2020-10-14 02:31:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:49,421 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:49,745 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:49,746 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 243 [2020-10-14 02:31:49,746 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:49,746 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 364 [2020-10-14 02:31:49,746 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:49,746 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:49,747 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:49,747 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 80 [2020-10-14 02:31:49,747 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-14 02:31:49,747 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:49,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:49,813 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:49,815 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:49,816 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:49,816 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:49,816 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:31:49,817 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:49,817 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:49,817 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:49,817 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:49,818 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:49,818 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:49,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:49,847 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:49,886 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:49,887 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 71 [2020-10-14 02:31:49,887 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:49,887 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 46 [2020-10-14 02:31:49,887 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:49,887 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:49,888 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:49,888 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:49,888 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 65 [2020-10-14 02:31:49,888 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:49,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-10-14 02:31:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:49,949 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:50,098 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:50,099 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-14 02:31:50,099 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:50,099 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 165 [2020-10-14 02:31:50,099 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:50,100 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:50,100 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:50,100 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:50,100 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-14 02:31:50,100 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:31:50,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127143747] [2020-10-14 02:31:50,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:50,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:50,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128857332] [2020-10-14 02:31:50,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:50,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:50,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:50,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:50,231 INFO L87 Difference]: Start difference. First operand 743 states and 958 transitions. Second operand 7 states. [2020-10-14 02:31:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:51,802 INFO L93 Difference]: Finished difference Result 1649 states and 2186 transitions. [2020-10-14 02:31:51,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-14 02:31:51,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 231 [2020-10-14 02:31:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:51,809 INFO L225 Difference]: With dead ends: 1649 [2020-10-14 02:31:51,809 INFO L226 Difference]: Without dead ends: 912 [2020-10-14 02:31:51,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-14 02:31:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2020-10-14 02:31:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 894. [2020-10-14 02:31:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-10-14 02:31:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1054 transitions. [2020-10-14 02:31:51,841 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1054 transitions. Word has length 231 [2020-10-14 02:31:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:51,842 INFO L479 AbstractCegarLoop]: Abstraction has 894 states and 1054 transitions. [2020-10-14 02:31:51,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1054 transitions. [2020-10-14 02:31:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2020-10-14 02:31:51,846 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:51,846 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:31:51,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-14 02:31:51,847 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:51,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:51,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2145615939, now seen corresponding path program 1 times [2020-10-14 02:31:51,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:51,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1044291145] [2020-10-14 02:31:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:51,900 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:51,988 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:52,340 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:56,151 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:56,152 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 250 [2020-10-14 02:31:56,152 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:31:56,152 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4269 [2020-10-14 02:31:56,152 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:56,152 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:56,153 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:56,153 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 87 [2020-10-14 02:31:56,153 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-14 02:31:56,153 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:56,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:56,222 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:56,225 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:56,225 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:56,226 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:56,226 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-10-14 02:31:56,226 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:56,226 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:56,227 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:56,227 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:56,227 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:56,228 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:56,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:56,263 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:56,302 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:56,302 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 78 [2020-10-14 02:31:56,303 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:56,303 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 48 [2020-10-14 02:31:56,303 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:56,303 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:56,303 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:56,304 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:56,304 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 72 [2020-10-14 02:31:56,304 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:56,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-10-14 02:31:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:56,364 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:56,538 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:56,538 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-14 02:31:56,539 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:56,539 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 190 [2020-10-14 02:31:56,539 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:56,540 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:56,540 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:56,540 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:56,541 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-14 02:31:56,541 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:31:56,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1044291145] [2020-10-14 02:31:56,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:56,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:56,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833447482] [2020-10-14 02:31:56,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:56,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:56,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:56,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:56,795 INFO L87 Difference]: Start difference. First operand 894 states and 1054 transitions. Second operand 7 states. [2020-10-14 02:31:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:31:58,390 INFO L93 Difference]: Finished difference Result 1947 states and 2380 transitions. [2020-10-14 02:31:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 02:31:58,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 238 [2020-10-14 02:31:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:31:58,397 INFO L225 Difference]: With dead ends: 1947 [2020-10-14 02:31:58,397 INFO L226 Difference]: Without dead ends: 1059 [2020-10-14 02:31:58,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-14 02:31:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2020-10-14 02:31:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1041. [2020-10-14 02:31:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2020-10-14 02:31:58,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1223 transitions. [2020-10-14 02:31:58,429 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1223 transitions. Word has length 238 [2020-10-14 02:31:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:31:58,430 INFO L479 AbstractCegarLoop]: Abstraction has 1041 states and 1223 transitions. [2020-10-14 02:31:58,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:31:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1223 transitions. [2020-10-14 02:31:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2020-10-14 02:31:58,435 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:31:58,435 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:31:58,436 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-14 02:31:58,436 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:31:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:31:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1617079905, now seen corresponding path program 1 times [2020-10-14 02:31:58,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:31:58,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1479228371] [2020-10-14 02:31:58,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:31:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:58,493 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:58,664 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:59,179 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:59,180 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 252 [2020-10-14 02:31:59,180 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-10-14 02:31:59,180 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 706 [2020-10-14 02:31:59,180 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:59,181 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:59,181 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:59,181 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 89 [2020-10-14 02:31:59,181 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-14 02:31:59,181 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:59,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:31:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:59,243 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:59,246 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:59,246 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:31:59,246 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:59,246 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 3 [2020-10-14 02:31:59,247 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:59,247 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:59,247 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:31:59,247 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:59,247 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:31:59,248 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:59,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:31:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:59,284 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:59,323 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:59,323 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 80 [2020-10-14 02:31:59,323 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:59,323 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 48 [2020-10-14 02:31:59,324 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:59,324 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:59,324 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:31:59,324 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:31:59,324 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-10-14 02:31:59,325 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:31:59,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-14 02:31:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:31:59,377 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:31:59,521 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:31:59,521 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-14 02:31:59,521 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:31:59,522 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 158 [2020-10-14 02:31:59,522 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:31:59,522 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:31:59,523 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:31:59,523 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:31:59,523 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-14 02:31:59,523 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:31:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:31:59,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1479228371] [2020-10-14 02:31:59,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:31:59,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:31:59,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265039970] [2020-10-14 02:31:59,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:31:59,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:31:59,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:31:59,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:31:59,697 INFO L87 Difference]: Start difference. First operand 1041 states and 1223 transitions. Second operand 7 states. [2020-10-14 02:32:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:01,186 INFO L93 Difference]: Finished difference Result 2698 states and 3293 transitions. [2020-10-14 02:32:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-14 02:32:01,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2020-10-14 02:32:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:01,193 INFO L225 Difference]: With dead ends: 2698 [2020-10-14 02:32:01,194 INFO L226 Difference]: Without dead ends: 1079 [2020-10-14 02:32:01,197 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-14 02:32:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2020-10-14 02:32:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 894. [2020-10-14 02:32:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-10-14 02:32:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1028 transitions. [2020-10-14 02:32:01,225 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1028 transitions. Word has length 240 [2020-10-14 02:32:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:01,225 INFO L479 AbstractCegarLoop]: Abstraction has 894 states and 1028 transitions. [2020-10-14 02:32:01,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:32:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1028 transitions. [2020-10-14 02:32:01,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2020-10-14 02:32:01,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:01,231 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-14 02:32:01,231 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-14 02:32:01,231 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:01,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2084590103, now seen corresponding path program 1 times [2020-10-14 02:32:01,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:01,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1123336872] [2020-10-14 02:32:01,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:01,393 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:01,750 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:01,751 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 288 [2020-10-14 02:32:01,751 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:01,751 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 454 [2020-10-14 02:32:01,751 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:01,752 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:01,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:01,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 125 [2020-10-14 02:32:01,752 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-14 02:32:01,752 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:01,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:01,831 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:01,833 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:01,833 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:01,833 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:01,834 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:32:01,834 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:01,834 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:01,835 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:32:01,835 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:01,835 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:32:01,836 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:01,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:01,886 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:01,964 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:01,964 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 116 [2020-10-14 02:32:01,964 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:01,964 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 93 [2020-10-14 02:32:01,965 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:01,965 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:01,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:01,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:01,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 110 [2020-10-14 02:32:01,966 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:01,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-10-14 02:32:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:02,046 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:02,191 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:02,191 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-14 02:32:02,192 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:02,192 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 162 [2020-10-14 02:32:02,192 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:02,192 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:02,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:02,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:32:02,193 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-14 02:32:02,193 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 148 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:32:02,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1123336872] [2020-10-14 02:32:02,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:32:02,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:32:02,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647491803] [2020-10-14 02:32:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:32:02,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:32:02,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:32:02,346 INFO L87 Difference]: Start difference. First operand 894 states and 1028 transitions. Second operand 7 states. [2020-10-14 02:32:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:03,849 INFO L93 Difference]: Finished difference Result 2444 states and 3015 transitions. [2020-10-14 02:32:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 02:32:03,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 276 [2020-10-14 02:32:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:03,858 INFO L225 Difference]: With dead ends: 2444 [2020-10-14 02:32:03,858 INFO L226 Difference]: Without dead ends: 1556 [2020-10-14 02:32:03,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-14 02:32:03,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2020-10-14 02:32:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1500. [2020-10-14 02:32:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2020-10-14 02:32:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1723 transitions. [2020-10-14 02:32:03,908 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1723 transitions. Word has length 276 [2020-10-14 02:32:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:03,909 INFO L479 AbstractCegarLoop]: Abstraction has 1500 states and 1723 transitions. [2020-10-14 02:32:03,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:32:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1723 transitions. [2020-10-14 02:32:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-10-14 02:32:03,916 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:03,917 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 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] [2020-10-14 02:32:03,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-14 02:32:03,917 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:03,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1818169282, now seen corresponding path program 1 times [2020-10-14 02:32:03,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:03,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1722999385] [2020-10-14 02:32:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:04,015 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:04,091 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:04,932 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:05,780 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:05,781 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 295 [2020-10-14 02:32:05,781 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-10-14 02:32:05,781 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1805 [2020-10-14 02:32:05,781 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:05,781 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:05,782 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:05,782 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 132 [2020-10-14 02:32:05,782 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 139 [2020-10-14 02:32:05,782 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:05,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-14 02:32:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:05,839 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:05,841 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:05,841 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 8 [2020-10-14 02:32:05,841 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:05,841 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 2 [2020-10-14 02:32:05,842 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:05,842 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:05,842 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-10-14 02:32:05,842 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:05,842 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-10-14 02:32:05,842 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-10-14 02:32:05,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-10-14 02:32:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:05,888 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:05,950 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:05,951 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 123 [2020-10-14 02:32:05,951 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:05,951 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 75 [2020-10-14 02:32:05,951 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:05,952 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:05,952 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-10-14 02:32:05,952 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-10-14 02:32:05,952 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 117 [2020-10-14 02:32:05,953 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:05,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2020-10-14 02:32:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-14 02:32:06,030 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-10-14 02:32:06,220 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-10-14 02:32:06,220 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 137 [2020-10-14 02:32:06,221 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-10-14 02:32:06,221 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 206 [2020-10-14 02:32:06,221 FATAL L256 erpolLogProxyWrapper]: Heuristic: WIDESTAMONGSMALL [2020-10-14 02:32:06,222 FATAL L256 erpolLogProxyWrapper]: Tolerance: 0.4 [2020-10-14 02:32:06,222 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-10-14 02:32:06,222 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 0 [2020-10-14 02:32:06,223 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 137 [2020-10-14 02:32:06,223 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-10-14 02:32:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 155 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-14 02:32:06,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1722999385] [2020-10-14 02:32:06,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-14 02:32:06,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-14 02:32:06,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565973465] [2020-10-14 02:32:06,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-14 02:32:06,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-14 02:32:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-14 02:32:06,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-14 02:32:06,469 INFO L87 Difference]: Start difference. First operand 1500 states and 1723 transitions. Second operand 7 states. [2020-10-14 02:32:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-14 02:32:08,787 INFO L93 Difference]: Finished difference Result 4633 states and 5608 transitions. [2020-10-14 02:32:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-14 02:32:08,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 283 [2020-10-14 02:32:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-14 02:32:08,804 INFO L225 Difference]: With dead ends: 4633 [2020-10-14 02:32:08,804 INFO L226 Difference]: Without dead ends: 2837 [2020-10-14 02:32:08,810 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-10-14 02:32:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2020-10-14 02:32:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2823. [2020-10-14 02:32:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2020-10-14 02:32:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 3321 transitions. [2020-10-14 02:32:08,896 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 3321 transitions. Word has length 283 [2020-10-14 02:32:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-14 02:32:08,897 INFO L479 AbstractCegarLoop]: Abstraction has 2823 states and 3321 transitions. [2020-10-14 02:32:08,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-14 02:32:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3321 transitions. [2020-10-14 02:32:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2020-10-14 02:32:08,907 INFO L414 BasicCegarLoop]: Found error trace [2020-10-14 02:32:08,908 INFO L422 BasicCegarLoop]: trace histogram [3, 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, 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] [2020-10-14 02:32:08,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-14 02:32:08,908 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-14 02:32:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-14 02:32:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash -377032971, now seen corresponding path program 1 times [2020-10-14 02:32:08,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-14 02:32:08,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687442216] [2020-10-14 02:32:08,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-14 02:32:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-14 02:32:08,971 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-14 02:32:08,971 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-14 02:32:08,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-14 02:32:09,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:32:09 BoogieIcfgContainer [2020-10-14 02:32:09,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-14 02:32:09,061 INFO L168 Benchmark]: Toolchain (without parser) took 34779.66 ms. Allocated memory was 148.4 MB in the beginning and 737.1 MB in the end (delta: 588.8 MB). Free memory was 101.8 MB in the beginning and 494.3 MB in the end (delta: -392.5 MB). Peak memory consumption was 196.3 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:09,062 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 148.4 MB. Free memory was 121.7 MB in the beginning and 121.3 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-14 02:32:09,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.14 ms. Allocated memory was 148.4 MB in the beginning and 207.1 MB in the end (delta: 58.7 MB). Free memory was 101.3 MB in the beginning and 172.0 MB in the end (delta: -70.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:09,063 INFO L168 Benchmark]: Boogie Preprocessor took 104.14 ms. Allocated memory is still 207.1 MB. Free memory was 172.0 MB in the beginning and 167.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:09,064 INFO L168 Benchmark]: RCFGBuilder took 1349.65 ms. Allocated memory was 207.1 MB in the beginning and 234.4 MB in the end (delta: 27.3 MB). Free memory was 167.2 MB in the beginning and 173.1 MB in the end (delta: -5.9 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:09,065 INFO L168 Benchmark]: TraceAbstraction took 32538.32 ms. Allocated memory was 234.4 MB in the beginning and 737.1 MB in the end (delta: 502.8 MB). Free memory was 173.1 MB in the beginning and 494.3 MB in the end (delta: -321.2 MB). Peak memory consumption was 181.6 MB. Max. memory is 7.1 GB. [2020-10-14 02:32:09,069 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.21 ms. Allocated memory is still 148.4 MB. Free memory was 121.7 MB in the beginning and 121.3 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.14 ms. Allocated memory was 148.4 MB in the beginning and 207.1 MB in the end (delta: 58.7 MB). Free memory was 101.3 MB in the beginning and 172.0 MB in the end (delta: -70.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.14 ms. Allocated memory is still 207.1 MB. Free memory was 172.0 MB in the beginning and 167.2 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1349.65 ms. Allocated memory was 207.1 MB in the beginning and 234.4 MB in the end (delta: 27.3 MB). Free memory was 167.2 MB in the beginning and 173.1 MB in the end (delta: -5.9 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32538.32 ms. Allocated memory was 234.4 MB in the beginning and 737.1 MB in the end (delta: 502.8 MB). Free memory was 173.1 MB in the beginning and 494.3 MB in the end (delta: -321.2 MB). Peak memory consumption was 181.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 61]: 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 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 TRUE ((a12==0) && (((((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a19==9)) && (a4==14)) && (a10==0))) [L541] a1 = (((((a1 + -272193) - -47605) - -570122) % 89)+ 110) [L542] a10 = 1 [L544] 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 TRUE ((a19==9) && ((a4==14) && ((a10==1) && (((input == 5) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a12==0))))) [L535] a1 = (((a1 + -438195) * 1) * 1) [L536] a10 = 2 [L537] a19 = 8 [L539] 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 FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND TRUE (((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8)) [L61] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.3s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 307 SDtfs, 3533 SDslu, 346 SDs, 0 SdLazy, 9253 SolverSat, 1413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2823occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1231 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 2151 NumberOfCodeBlocks, 2151 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1843 ConstructedInterpolants, 0 QuantifiedInterpolants, 896637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 702/715 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...