/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 false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label44.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 15:02:02,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 15:02:02,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 15:02:02,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 15:02:02,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 15:02:02,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 15:02:02,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 15:02:02,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 15:02:02,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 15:02:02,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 15:02:02,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 15:02:02,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 15:02:02,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 15:02:02,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 15:02:02,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 15:02:02,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 15:02:02,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 15:02:02,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 15:02:02,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 15:02:02,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 15:02:02,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 15:02:02,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 15:02:02,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 15:02:02,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 15:02:02,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 15:02:02,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 15:02:02,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 15:02:02,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 15:02:02,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 15:02:02,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 15:02:02,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 15:02:02,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 15:02:02,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 15:02:02,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 15:02:02,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 15:02:02,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 15:02:02,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 15:02:02,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 15:02:02,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 15:02:02,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 15:02:02,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 15:02:02,185 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 15:02:02,212 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 15:02:02,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 15:02:02,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 15:02:02,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 15:02:02,215 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 15:02:02,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 15:02:02,215 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 15:02:02,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 15:02:02,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 15:02:02,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 15:02:02,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 15:02:02,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 15:02:02,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 15:02:02,216 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 15:02:02,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 15:02:02,217 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 15:02:02,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 15:02:02,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 15:02:02,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 15:02:02,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 15:02:02,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 15:02:02,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 15:02:02,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 15:02:02,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 15:02:02,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 15:02:02,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 15:02:02,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 15:02:02,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 15:02:02,220 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 15:02:02,220 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 -> false [2020-09-24 15:02:02,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 15:02:02,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 15:02:02,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 15:02:02,727 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 15:02:02,728 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 15:02:02,729 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label44.c [2020-09-24 15:02:02,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1df6dab07/af16e2a1ced84802a63d0f1fffab7c00/FLAG4ccaaa566 [2020-09-24 15:02:03,504 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 15:02:03,506 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem02_label44.c [2020-09-24 15:02:03,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1df6dab07/af16e2a1ced84802a63d0f1fffab7c00/FLAG4ccaaa566 [2020-09-24 15:02:03,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/1df6dab07/af16e2a1ced84802a63d0f1fffab7c00 [2020-09-24 15:02:03,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 15:02:03,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 15:02:03,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 15:02:03,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 15:02:03,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 15:02:03,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:02:03" (1/1) ... [2020-09-24 15:02:03,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a03fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:03, skipping insertion in model container [2020-09-24 15:02:03,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 03:02:03" (1/1) ... [2020-09-24 15:02:03,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 15:02:03,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 15:02:04,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:02:04,291 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 15:02:04,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 15:02:04,568 INFO L208 MainTranslator]: Completed translation [2020-09-24 15:02:04,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04 WrapperNode [2020-09-24 15:02:04,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 15:02:04,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 15:02:04,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 15:02:04,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 15:02:04,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04" (1/1) ... [2020-09-24 15:02:04,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04" (1/1) ... [2020-09-24 15:02:04,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04" (1/1) ... [2020-09-24 15:02:04,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04" (1/1) ... [2020-09-24 15:02:04,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04" (1/1) ... [2020-09-24 15:02:04,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04" (1/1) ... [2020-09-24 15:02:04,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04" (1/1) ... [2020-09-24 15:02:04,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 15:02:04,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 15:02:04,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 15:02:04,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 15:02:04,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04" (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 15:02:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 15:02:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 15:02:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 15:02:04,772 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 15:02:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 15:02:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 15:02:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 15:02:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 15:02:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 15:02:04,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 15:02:04,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 15:02:06,189 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 15:02:06,189 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 15:02:06,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:02:06 BoogieIcfgContainer [2020-09-24 15:02:06,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 15:02:06,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 15:02:06,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 15:02:06,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 15:02:06,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 03:02:03" (1/3) ... [2020-09-24 15:02:06,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5510976b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:02:06, skipping insertion in model container [2020-09-24 15:02:06,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 03:02:04" (2/3) ... [2020-09-24 15:02:06,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5510976b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 03:02:06, skipping insertion in model container [2020-09-24 15:02:06,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 03:02:06" (3/3) ... [2020-09-24 15:02:06,211 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label44.c [2020-09-24 15:02:06,223 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 15:02:06,235 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 15:02:06,256 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 15:02:06,298 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 15:02:06,298 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 15:02:06,298 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 15:02:06,299 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 15:02:06,299 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 15:02:06,299 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 15:02:06,299 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 15:02:06,299 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 15:02:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states. [2020-09-24 15:02:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-09-24 15:02:06,351 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:06,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:02:06,354 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:06,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash -118135375, now seen corresponding path program 1 times [2020-09-24 15:02:06,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:06,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1136863733] [2020-09-24 15:02:06,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:06,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:07,026 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 15:02:07,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1136863733] [2020-09-24 15:02:07,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 15:02:07,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-24 15:02:07,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163248336] [2020-09-24 15:02:07,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:02:07,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:02:07,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:02:07,062 INFO L87 Difference]: Start difference. First operand 527 states. Second operand 5 states. [2020-09-24 15:02:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:10,244 INFO L93 Difference]: Finished difference Result 1431 states and 2025 transitions. [2020-09-24 15:02:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-24 15:02:10,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-09-24 15:02:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:10,274 INFO L225 Difference]: With dead ends: 1431 [2020-09-24 15:02:10,274 INFO L226 Difference]: Without dead ends: 848 [2020-09-24 15:02:10,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-09-24 15:02:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2020-09-24 15:02:10,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 775. [2020-09-24 15:02:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-09-24 15:02:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 942 transitions. [2020-09-24 15:02:10,400 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 942 transitions. Word has length 114 [2020-09-24 15:02:10,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:10,401 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 942 transitions. [2020-09-24 15:02:10,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:02:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 942 transitions. [2020-09-24 15:02:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-09-24 15:02:10,414 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:10,414 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-09-24 15:02:10,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 15:02:10,415 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash -294296002, now seen corresponding path program 1 times [2020-09-24 15:02:10,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:10,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [276987527] [2020-09-24 15:02:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:10,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:10,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:10,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-09-24 15:02:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:02:10,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [276987527] [2020-09-24 15:02:10,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:10,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-24 15:02:10,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464209012] [2020-09-24 15:02:10,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-24 15:02:10,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-24 15:02:10,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-24 15:02:10,790 INFO L87 Difference]: Start difference. First operand 775 states and 942 transitions. Second operand 10 states. [2020-09-24 15:02:11,796 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-09-24 15:02:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:14,805 INFO L93 Difference]: Finished difference Result 2457 states and 3209 transitions. [2020-09-24 15:02:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-24 15:02:14,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2020-09-24 15:02:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:14,822 INFO L225 Difference]: With dead ends: 2457 [2020-09-24 15:02:14,823 INFO L226 Difference]: Without dead ends: 1704 [2020-09-24 15:02:14,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2020-09-24 15:02:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2020-09-24 15:02:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1495. [2020-09-24 15:02:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2020-09-24 15:02:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1842 transitions. [2020-09-24 15:02:14,935 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1842 transitions. Word has length 149 [2020-09-24 15:02:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:14,936 INFO L479 AbstractCegarLoop]: Abstraction has 1495 states and 1842 transitions. [2020-09-24 15:02:14,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-24 15:02:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1842 transitions. [2020-09-24 15:02:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-09-24 15:02:14,952 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:14,953 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:14,954 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 15:02:14,954 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:14,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:14,955 INFO L82 PathProgramCache]: Analyzing trace with hash -724783129, now seen corresponding path program 1 times [2020-09-24 15:02:14,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:14,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1309831531] [2020-09-24 15:02:14,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:15,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:15,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:15,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-09-24 15:02:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-24 15:02:15,363 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1309831531] [2020-09-24 15:02:15,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:15,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-24 15:02:15,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093175249] [2020-09-24 15:02:15,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 15:02:15,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:15,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 15:02:15,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-24 15:02:15,380 INFO L87 Difference]: Start difference. First operand 1495 states and 1842 transitions. Second operand 9 states. [2020-09-24 15:02:19,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:19,342 INFO L93 Difference]: Finished difference Result 3807 states and 5003 transitions. [2020-09-24 15:02:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-24 15:02:19,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 154 [2020-09-24 15:02:19,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:19,362 INFO L225 Difference]: With dead ends: 3807 [2020-09-24 15:02:19,363 INFO L226 Difference]: Without dead ends: 2334 [2020-09-24 15:02:19,369 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2020-09-24 15:02:19,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2020-09-24 15:02:19,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2170. [2020-09-24 15:02:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2020-09-24 15:02:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2652 transitions. [2020-09-24 15:02:19,470 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2652 transitions. Word has length 154 [2020-09-24 15:02:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:19,471 INFO L479 AbstractCegarLoop]: Abstraction has 2170 states and 2652 transitions. [2020-09-24 15:02:19,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 15:02:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2652 transitions. [2020-09-24 15:02:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-09-24 15:02:19,481 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:19,481 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-24 15:02:19,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 15:02:19,482 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:19,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1690875967, now seen corresponding path program 1 times [2020-09-24 15:02:19,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:19,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [713128542] [2020-09-24 15:02:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:19,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:19,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:02:19,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [713128542] [2020-09-24 15:02:19,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:19,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:02:19,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989132838] [2020-09-24 15:02:19,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:02:19,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:02:19,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:02:19,733 INFO L87 Difference]: Start difference. First operand 2170 states and 2652 transitions. Second operand 5 states. [2020-09-24 15:02:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:21,567 INFO L93 Difference]: Finished difference Result 4380 states and 5357 transitions. [2020-09-24 15:02:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:02:21,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2020-09-24 15:02:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:21,587 INFO L225 Difference]: With dead ends: 4380 [2020-09-24 15:02:21,587 INFO L226 Difference]: Without dead ends: 2232 [2020-09-24 15:02:21,594 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 15:02:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2020-09-24 15:02:21,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2020. [2020-09-24 15:02:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2020-09-24 15:02:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2373 transitions. [2020-09-24 15:02:21,659 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2373 transitions. Word has length 157 [2020-09-24 15:02:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:21,660 INFO L479 AbstractCegarLoop]: Abstraction has 2020 states and 2373 transitions. [2020-09-24 15:02:21,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:02:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2373 transitions. [2020-09-24 15:02:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-09-24 15:02:21,667 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:21,668 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-24 15:02:21,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 15:02:21,668 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash 276144705, now seen corresponding path program 1 times [2020-09-24 15:02:21,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:21,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2004132835] [2020-09-24 15:02:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:21,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 15:02:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:21,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-24 15:02:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 15:02:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 15:02:21,961 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2004132835] [2020-09-24 15:02:21,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 15:02:21,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 15:02:21,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919522349] [2020-09-24 15:02:21,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 15:02:21,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 15:02:21,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 15:02:21,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 15:02:21,964 INFO L87 Difference]: Start difference. First operand 2020 states and 2373 transitions. Second operand 5 states. [2020-09-24 15:02:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 15:02:23,543 INFO L93 Difference]: Finished difference Result 5091 states and 6072 transitions. [2020-09-24 15:02:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 15:02:23,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2020-09-24 15:02:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 15:02:23,563 INFO L225 Difference]: With dead ends: 5091 [2020-09-24 15:02:23,563 INFO L226 Difference]: Without dead ends: 3093 [2020-09-24 15:02:23,573 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 15:02:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3093 states. [2020-09-24 15:02:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3093 to 2021. [2020-09-24 15:02:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2020-09-24 15:02:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2377 transitions. [2020-09-24 15:02:23,652 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2377 transitions. Word has length 173 [2020-09-24 15:02:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 15:02:23,652 INFO L479 AbstractCegarLoop]: Abstraction has 2021 states and 2377 transitions. [2020-09-24 15:02:23,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 15:02:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2377 transitions. [2020-09-24 15:02:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-09-24 15:02:23,661 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 15:02:23,661 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-24 15:02:23,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-24 15:02:23,662 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 15:02:23,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 15:02:23,662 INFO L82 PathProgramCache]: Analyzing trace with hash 843363750, now seen corresponding path program 1 times [2020-09-24 15:02:23,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 15:02:23,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [249931517] [2020-09-24 15:02:23,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 15:02:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 15:02:23,747 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 15:02:23,747 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 15:02:23,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-24 15:02:23,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 03:02:23 BoogieIcfgContainer [2020-09-24 15:02:23,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 15:02:23,800 INFO L168 Benchmark]: Toolchain (without parser) took 20113.09 ms. Allocated memory was 147.8 MB in the beginning and 458.8 MB in the end (delta: 310.9 MB). Free memory was 102.5 MB in the beginning and 134.2 MB in the end (delta: -31.7 MB). Peak memory consumption was 279.2 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:23,801 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-24 15:02:23,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 873.78 ms. Allocated memory was 147.8 MB in the beginning and 206.0 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 173.1 MB in the end (delta: -71.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:23,803 INFO L168 Benchmark]: Boogie Preprocessor took 110.23 ms. Allocated memory is still 206.0 MB. Free memory was 173.1 MB in the beginning and 168.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:23,804 INFO L168 Benchmark]: RCFGBuilder took 1520.89 ms. Allocated memory was 206.0 MB in the beginning and 239.6 MB in the end (delta: 33.6 MB). Free memory was 168.2 MB in the beginning and 162.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 82.2 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:23,805 INFO L168 Benchmark]: TraceAbstraction took 17596.11 ms. Allocated memory was 239.6 MB in the beginning and 458.8 MB in the end (delta: 219.2 MB). Free memory was 162.6 MB in the beginning and 134.2 MB in the end (delta: 28.5 MB). Peak memory consumption was 247.6 MB. Max. memory is 7.1 GB. [2020-09-24 15:02:23,809 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.37 ms. Allocated memory is still 147.8 MB. Free memory was 122.4 MB in the beginning and 122.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 873.78 ms. Allocated memory was 147.8 MB in the beginning and 206.0 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 173.1 MB in the end (delta: -71.2 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.23 ms. Allocated memory is still 206.0 MB. Free memory was 173.1 MB in the beginning and 168.2 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1520.89 ms. Allocated memory was 206.0 MB in the beginning and 239.6 MB in the end (delta: 33.6 MB). Free memory was 168.2 MB in the beginning and 162.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 82.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17596.11 ms. Allocated memory was 239.6 MB in the beginning and 458.8 MB in the end (delta: 219.2 MB). Free memory was 162.6 MB in the beginning and 134.2 MB in the end (delta: 28.5 MB). Peak memory consumption was 247.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 436]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND TRUE ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))) [L51] a28 = 11 [L52] a25 = 1 [L53] return 26; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND TRUE (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))) [L350] a28 = 9 [L351] a11 = 1 [L352] a25 = 0 [L353] return -1; [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) [L426] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))) [L429] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7))) [L432] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7))) [L435] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) [L436] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 527 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.4s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1522 SDtfs, 6033 SDslu, 1622 SDs, 0 SdLazy, 7436 SolverSat, 1019 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2170occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 1730 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 962 NumberOfCodeBlocks, 962 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 742 ConstructedInterpolants, 0 QuantifiedInterpolants, 323573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 144/157 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...