/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 SingleStatement --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=1000 --traceabstraction.additional.smt.options interpolation-heuristic=SMALLEST --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 19:29:58,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 19:29:58,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 19:29:58,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 19:29:58,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 19:29:58,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 19:29:58,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 19:29:58,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 19:29:58,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 19:29:58,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 19:29:58,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 19:29:58,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 19:29:58,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 19:29:58,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 19:29:58,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 19:29:58,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 19:29:58,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 19:29:58,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 19:29:58,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 19:29:58,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 19:29:58,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 19:29:58,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 19:29:58,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 19:29:58,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 19:29:58,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 19:29:58,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 19:29:58,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 19:29:58,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 19:29:58,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 19:29:58,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 19:29:58,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 19:29:58,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 19:29:58,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 19:29:58,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 19:29:58,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 19:29:58,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 19:29:58,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 19:29:58,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 19:29:58,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 19:29:58,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 19:29:58,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 19:29:58,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-24 19:29:58,535 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 19:29:58,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 19:29:58,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 19:29:58,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 19:29:58,537 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 19:29:58,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 19:29:58,538 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 19:29:58,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 19:29:58,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 19:29:58,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 19:29:58,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 19:29:58,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 19:29:58,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 19:29:58,539 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 19:29:58,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 19:29:58,540 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 19:29:58,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 19:29:58,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 19:29:58,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 19:29:58,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 19:29:58,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 19:29:58,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 19:29:58,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 19:29:58,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 19:29:58,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 19:29:58,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 19:29:58,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 19:29:58,542 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 19:29:58,542 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 19:29:58,543 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 -> SingleStatement 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=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=1000;interpolation-heuristic=SMALLEST;log-additional-information=true; [2020-09-24 19:29:59,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 19:29:59,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 19:29:59,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 19:29:59,057 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 19:29:59,058 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 19:29:59,059 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-24 19:29:59,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/549c70530/ecef268ba1234cb1ad5099771a60a7de/FLAGba38215fe [2020-09-24 19:29:59,815 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 19:29:59,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-24 19:29:59,833 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/549c70530/ecef268ba1234cb1ad5099771a60a7de/FLAGba38215fe [2020-09-24 19:30:00,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/549c70530/ecef268ba1234cb1ad5099771a60a7de [2020-09-24 19:30:00,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 19:30:00,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 19:30:00,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 19:30:00,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 19:30:00,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 19:30:00,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 07:30:00" (1/1) ... [2020-09-24 19:30:00,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738c85d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00, skipping insertion in model container [2020-09-24 19:30:00,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 07:30:00" (1/1) ... [2020-09-24 19:30:00,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 19:30:00,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 19:30:00,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 19:30:00,718 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 19:30:00,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 19:30:00,859 INFO L208 MainTranslator]: Completed translation [2020-09-24 19:30:00,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00 WrapperNode [2020-09-24 19:30:00,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 19:30:00,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 19:30:00,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 19:30:00,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 19:30:00,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00" (1/1) ... [2020-09-24 19:30:00,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00" (1/1) ... [2020-09-24 19:30:00,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00" (1/1) ... [2020-09-24 19:30:00,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00" (1/1) ... [2020-09-24 19:30:00,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00" (1/1) ... [2020-09-24 19:30:00,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00" (1/1) ... [2020-09-24 19:30:00,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00" (1/1) ... [2020-09-24 19:30:00,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 19:30:00,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 19:30:00,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 19:30:00,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 19:30:01,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 19:30:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 19:30:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 19:30:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 19:30:01,098 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 19:30:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 19:30:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 19:30:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 19:30:01,099 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 19:30:01,100 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 19:30:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 19:30:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 19:30:02,744 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 19:30:02,745 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 19:30:02,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 07:30:02 BoogieIcfgContainer [2020-09-24 19:30:02,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 19:30:02,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 19:30:02,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 19:30:02,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 19:30:02,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 07:30:00" (1/3) ... [2020-09-24 19:30:02,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 07:30:02, skipping insertion in model container [2020-09-24 19:30:02,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 07:30:00" (2/3) ... [2020-09-24 19:30:02,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728c409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 07:30:02, skipping insertion in model container [2020-09-24 19:30:02,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 07:30:02" (3/3) ... [2020-09-24 19:30:02,763 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-09-24 19:30:02,775 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 19:30:02,787 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 19:30:02,810 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 19:30:02,845 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 19:30:02,845 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 19:30:02,846 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 19:30:02,846 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 19:30:02,846 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 19:30:02,846 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 19:30:02,846 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 19:30:02,846 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 19:30:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-24 19:30:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-24 19:30:02,886 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:02,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:02,888 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash 969247631, now seen corresponding path program 1 times [2020-09-24 19:30:02,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:02,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791069953] [2020-09-24 19:30:02,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:03,116 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:03,245 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:03,731 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:03,731 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 45 [2020-09-24 19:30:03,731 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-24 19:30:03,732 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 659 [2020-09-24 19:30:03,735 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:03,735 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-24 19:30:03,736 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 12 [2020-09-24 19:30:03,736 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 32 [2020-09-24 19:30:03,736 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-09-24 19:30:03,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:03,865 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:03,884 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:03,885 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:03,885 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:03,886 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 23 [2020-09-24 19:30:03,886 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:03,887 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:03,887 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:03,888 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 8 [2020-09-24 19:30:03,888 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:03,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791069953] [2020-09-24 19:30:03,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 19:30:03,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-24 19:30:03,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577200616] [2020-09-24 19:30:03,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-24 19:30:03,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:03,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-24 19:30:03,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-24 19:30:03,946 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-24 19:30:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:06,168 INFO L93 Difference]: Finished difference Result 1069 states and 1495 transitions. [2020-09-24 19:30:06,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-24 19:30:06,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-09-24 19:30:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:06,193 INFO L225 Difference]: With dead ends: 1069 [2020-09-24 19:30:06,194 INFO L226 Difference]: Without dead ends: 555 [2020-09-24 19:30:06,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-09-24 19:30:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543. [2020-09-24 19:30:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-09-24 19:30:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 695 transitions. [2020-09-24 19:30:06,307 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 695 transitions. Word has length 36 [2020-09-24 19:30:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:06,308 INFO L479 AbstractCegarLoop]: Abstraction has 543 states and 695 transitions. [2020-09-24 19:30:06,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-24 19:30:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 695 transitions. [2020-09-24 19:30:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-09-24 19:30:06,315 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:06,316 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2020-09-24 19:30:06,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 19:30:06,317 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:06,317 INFO L82 PathProgramCache]: Analyzing trace with hash -340660504, now seen corresponding path program 1 times [2020-09-24 19:30:06,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:06,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [307818949] [2020-09-24 19:30:06,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:06,393 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:06,647 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:07,083 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:07,138 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:07,379 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:07,380 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 130 [2020-09-24 19:30:07,380 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 4 [2020-09-24 19:30:07,380 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1017 [2020-09-24 19:30:07,381 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:07,381 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:07,381 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 98 [2020-09-24 19:30:07,381 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 31 [2020-09-24 19:30:07,381 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:07,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:07,450 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:07,457 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:07,458 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:07,458 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:07,458 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-24 19:30:07,458 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:07,459 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:07,459 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:07,459 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:07,459 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:07,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:07,507 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:07,596 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:07,597 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 79 [2020-09-24 19:30:07,597 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:07,597 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 105 [2020-09-24 19:30:07,598 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:07,598 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:07,598 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:07,598 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 69 [2020-09-24 19:30:07,599 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:07,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [307818949] [2020-09-24 19:30:07,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:07,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 19:30:07,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544832238] [2020-09-24 19:30:07,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 19:30:07,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:07,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 19:30:07,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:07,684 INFO L87 Difference]: Start difference. First operand 543 states and 695 transitions. Second operand 5 states. [2020-09-24 19:30:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:09,725 INFO L93 Difference]: Finished difference Result 1463 states and 1941 transitions. [2020-09-24 19:30:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 19:30:09,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2020-09-24 19:30:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:09,735 INFO L225 Difference]: With dead ends: 1463 [2020-09-24 19:30:09,735 INFO L226 Difference]: Without dead ends: 935 [2020-09-24 19:30:09,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 19:30:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-09-24 19:30:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 728. [2020-09-24 19:30:09,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2020-09-24 19:30:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 940 transitions. [2020-09-24 19:30:09,803 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 940 transitions. Word has length 119 [2020-09-24 19:30:09,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:09,804 INFO L479 AbstractCegarLoop]: Abstraction has 728 states and 940 transitions. [2020-09-24 19:30:09,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 19:30:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 940 transitions. [2020-09-24 19:30:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-09-24 19:30:09,808 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:09,808 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:09,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 19:30:09,808 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:09,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:09,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1359994051, now seen corresponding path program 1 times [2020-09-24 19:30:09,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:09,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1318576651] [2020-09-24 19:30:09,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:09,871 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:10,109 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:10,109 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 136 [2020-09-24 19:30:10,109 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:10,110 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 265 [2020-09-24 19:30:10,110 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:10,110 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:10,110 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-09-24 19:30:10,111 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 30 [2020-09-24 19:30:10,111 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:10,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:10,190 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:10,199 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:10,200 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:10,200 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:10,201 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 14 [2020-09-24 19:30:10,201 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:10,201 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:10,202 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:10,202 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:10,202 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:10,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:10,273 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:10,378 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:10,378 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-24 19:30:10,379 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:10,379 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 135 [2020-09-24 19:30:10,380 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:10,380 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:10,380 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:10,381 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-09-24 19:30:10,381 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:10,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1318576651] [2020-09-24 19:30:10,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:10,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 19:30:10,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958496040] [2020-09-24 19:30:10,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 19:30:10,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:10,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 19:30:10,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:10,502 INFO L87 Difference]: Start difference. First operand 728 states and 940 transitions. Second operand 5 states. [2020-09-24 19:30:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:12,418 INFO L93 Difference]: Finished difference Result 1937 states and 2621 transitions. [2020-09-24 19:30:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 19:30:12,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2020-09-24 19:30:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:12,432 INFO L225 Difference]: With dead ends: 1937 [2020-09-24 19:30:12,432 INFO L226 Difference]: Without dead ends: 1224 [2020-09-24 19:30:12,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 19:30:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-09-24 19:30:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1184. [2020-09-24 19:30:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2020-09-24 19:30:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1598 transitions. [2020-09-24 19:30:12,507 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1598 transitions. Word has length 125 [2020-09-24 19:30:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:12,512 INFO L479 AbstractCegarLoop]: Abstraction has 1184 states and 1598 transitions. [2020-09-24 19:30:12,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 19:30:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1598 transitions. [2020-09-24 19:30:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-09-24 19:30:12,525 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:12,525 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:12,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 19:30:12,526 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1182078239, now seen corresponding path program 1 times [2020-09-24 19:30:12,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:12,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [672297269] [2020-09-24 19:30:12,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:12,629 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:13,132 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:13,136 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 169 [2020-09-24 19:30:13,136 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:13,137 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 544 [2020-09-24 19:30:13,137 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:13,137 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-24 19:30:13,138 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 13 [2020-09-24 19:30:13,138 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 124 [2020-09-24 19:30:13,138 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:13,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:13,208 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:13,222 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:13,222 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:13,223 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:13,223 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 16 [2020-09-24 19:30:13,223 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:13,223 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:13,224 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:13,224 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9 [2020-09-24 19:30:13,224 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:13,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:13,294 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:13,499 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:13,499 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 118 [2020-09-24 19:30:13,499 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:13,499 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 228 [2020-09-24 19:30:13,500 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:13,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:13,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-24 19:30:13,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 117 [2020-09-24 19:30:13,501 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:13,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [672297269] [2020-09-24 19:30:13,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 19:30:13,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-24 19:30:13,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626216368] [2020-09-24 19:30:13,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-24 19:30:13,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:13,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-24 19:30:13,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-24 19:30:13,680 INFO L87 Difference]: Start difference. First operand 1184 states and 1598 transitions. Second operand 7 states. [2020-09-24 19:30:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:15,543 INFO L93 Difference]: Finished difference Result 2441 states and 3357 transitions. [2020-09-24 19:30:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-24 19:30:15,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2020-09-24 19:30:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:15,555 INFO L225 Difference]: With dead ends: 2441 [2020-09-24 19:30:15,555 INFO L226 Difference]: Without dead ends: 1272 [2020-09-24 19:30:15,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-09-24 19:30:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2020-09-24 19:30:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1050. [2020-09-24 19:30:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2020-09-24 19:30:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1242 transitions. [2020-09-24 19:30:15,610 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1242 transitions. Word has length 158 [2020-09-24 19:30:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:15,611 INFO L479 AbstractCegarLoop]: Abstraction has 1050 states and 1242 transitions. [2020-09-24 19:30:15,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-24 19:30:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1242 transitions. [2020-09-24 19:30:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-09-24 19:30:15,614 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:15,614 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:15,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 19:30:15,615 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash -81614816, now seen corresponding path program 1 times [2020-09-24 19:30:15,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:15,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [497899474] [2020-09-24 19:30:15,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:15,710 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:16,068 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:16,668 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:16,669 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 174 [2020-09-24 19:30:16,669 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-24 19:30:16,669 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1000 [2020-09-24 19:30:16,669 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:16,670 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 19:30:16,670 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 142 [2020-09-24 19:30:16,670 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 31 [2020-09-24 19:30:16,670 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 19:30:16,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 19:30:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:16,757 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:16,765 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:16,765 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 19:30:16,765 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:16,766 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 10 [2020-09-24 19:30:16,766 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:16,766 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 19:30:16,766 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:16,767 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 19:30:16,767 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:16,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 19:30:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 19:30:16,835 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 19:30:16,955 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-24 19:30:16,955 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 123 [2020-09-24 19:30:16,955 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 19:30:16,956 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 144 [2020-09-24 19:30:16,956 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-24 19:30:16,956 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 19:30:16,956 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 19:30:16,957 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 113 [2020-09-24 19:30:16,957 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 19:30:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 19:30:17,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [497899474] [2020-09-24 19:30:17,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 19:30:17,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 19:30:17,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198103543] [2020-09-24 19:30:17,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 19:30:17,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 19:30:17,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 19:30:17,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 19:30:17,072 INFO L87 Difference]: Start difference. First operand 1050 states and 1242 transitions. Second operand 5 states. [2020-09-24 19:30:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 19:30:19,032 INFO L93 Difference]: Finished difference Result 2616 states and 3144 transitions. [2020-09-24 19:30:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 19:30:19,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2020-09-24 19:30:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 19:30:19,043 INFO L225 Difference]: With dead ends: 2616 [2020-09-24 19:30:19,043 INFO L226 Difference]: Without dead ends: 1581 [2020-09-24 19:30:19,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 19:30:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2020-09-24 19:30:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1380. [2020-09-24 19:30:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2020-09-24 19:30:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1660 transitions. [2020-09-24 19:30:19,096 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1660 transitions. Word has length 163 [2020-09-24 19:30:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 19:30:19,097 INFO L479 AbstractCegarLoop]: Abstraction has 1380 states and 1660 transitions. [2020-09-24 19:30:19,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 19:30:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1660 transitions. [2020-09-24 19:30:19,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-09-24 19:30:19,102 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 19:30:19,103 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 19:30:19,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 19:30:19,103 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 19:30:19,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 19:30:19,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1776525167, now seen corresponding path program 1 times [2020-09-24 19:30:19,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 19:30:19,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [979929600] [2020-09-24 19:30:19,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 19:30:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 19:30:19,199 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 19:30:19,200 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 19:30:19,209 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 19:30:19,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 07:30:19 BoogieIcfgContainer [2020-09-24 19:30:19,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 19:30:19,274 INFO L168 Benchmark]: Toolchain (without parser) took 19238.33 ms. Allocated memory was 146.3 MB in the beginning and 464.5 MB in the end (delta: 318.2 MB). Free memory was 101.0 MB in the beginning and 414.0 MB in the end (delta: -312.9 MB). Peak memory consumption was 279.6 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:19,276 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-24 19:30:19,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.43 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.4 MB in the beginning and 171.0 MB in the end (delta: -70.6 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:19,285 INFO L168 Benchmark]: Boogie Preprocessor took 135.37 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 166.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:19,286 INFO L168 Benchmark]: RCFGBuilder took 1756.79 ms. Allocated memory was 205.0 MB in the beginning and 238.0 MB in the end (delta: 33.0 MB). Free memory was 166.1 MB in the beginning and 164.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:19,288 INFO L168 Benchmark]: TraceAbstraction took 16515.36 ms. Allocated memory was 238.0 MB in the beginning and 464.5 MB in the end (delta: 226.5 MB). Free memory was 164.2 MB in the beginning and 414.0 MB in the end (delta: -249.8 MB). Peak memory consumption was 251.0 MB. Max. memory is 7.1 GB. [2020-09-24 19:30:19,301 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.22 ms. Allocated memory is still 146.3 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.43 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.4 MB in the beginning and 171.0 MB in the end (delta: -70.6 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.37 ms. Allocated memory is still 205.0 MB. Free memory was 171.0 MB in the beginning and 166.1 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1756.79 ms. Allocated memory was 205.0 MB in the beginning and 238.0 MB in the end (delta: 33.0 MB). Free memory was 166.1 MB in the beginning and 164.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 82.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16515.36 ms. Allocated memory was 238.0 MB in the beginning and 464.5 MB in the end (delta: 226.5 MB). Free memory was 164.2 MB in the beginning and 414.0 MB in the end (delta: -249.8 MB). Peak memory consumption was 251.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] return 22; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L55] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.3s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1017 SDtfs, 3741 SDslu, 981 SDs, 0 SdLazy, 4911 SolverSat, 799 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1380occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 682 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 838 NumberOfCodeBlocks, 838 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 167549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 77/80 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...