/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options 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_label15.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 12:31:07,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 12:31:07,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 12:31:07,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 12:31:07,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 12:31:07,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 12:31:07,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 12:31:07,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 12:31:07,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 12:31:07,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 12:31:07,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 12:31:07,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 12:31:07,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 12:31:07,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 12:31:07,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 12:31:07,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 12:31:07,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 12:31:07,107 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 12:31:07,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 12:31:07,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 12:31:07,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 12:31:07,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 12:31:07,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 12:31:07,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 12:31:07,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 12:31:07,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 12:31:07,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 12:31:07,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 12:31:07,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 12:31:07,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 12:31:07,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 12:31:07,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 12:31:07,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 12:31:07,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 12:31:07,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 12:31:07,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 12:31:07,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 12:31:07,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 12:31:07,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 12:31:07,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 12:31:07,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 12:31:07,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 12:31:07,152 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 12:31:07,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 12:31:07,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 12:31:07,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 12:31:07,154 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 12:31:07,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 12:31:07,155 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 12:31:07,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 12:31:07,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 12:31:07,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 12:31:07,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 12:31:07,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 12:31:07,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 12:31:07,156 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 12:31:07,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 12:31:07,156 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 12:31:07,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 12:31:07,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 12:31:07,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 12:31:07,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 12:31:07,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 12:31:07,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 12:31:07,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 12:31:07,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 12:31:07,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 12:31:07,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 12:31:07,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 12:31:07,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 12:31:07,159 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 12:31:07,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;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-21 12:31:07,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 12:31:07,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 12:31:07,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 12:31:07,628 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 12:31:07,630 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 12:31:07,631 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-21 12:31:07,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2f21a973c/66cf8a32705a45018634b63940d6b0d0/FLAGc841a425d [2020-09-21 12:31:08,336 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 12:31:08,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label15.c [2020-09-21 12:31:08,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2f21a973c/66cf8a32705a45018634b63940d6b0d0/FLAGc841a425d [2020-09-21 12:31:08,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2f21a973c/66cf8a32705a45018634b63940d6b0d0 [2020-09-21 12:31:08,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 12:31:08,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 12:31:08,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 12:31:08,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 12:31:08,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 12:31:08,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:31:08" (1/1) ... [2020-09-21 12:31:08,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e85a8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:08, skipping insertion in model container [2020-09-21 12:31:08,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:31:08" (1/1) ... [2020-09-21 12:31:08,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 12:31:08,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 12:31:09,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 12:31:09,287 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 12:31:09,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 12:31:09,414 INFO L208 MainTranslator]: Completed translation [2020-09-21 12:31:09,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09 WrapperNode [2020-09-21 12:31:09,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 12:31:09,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 12:31:09,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 12:31:09,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 12:31:09,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09" (1/1) ... [2020-09-21 12:31:09,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09" (1/1) ... [2020-09-21 12:31:09,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09" (1/1) ... [2020-09-21 12:31:09,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09" (1/1) ... [2020-09-21 12:31:09,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09" (1/1) ... [2020-09-21 12:31:09,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09" (1/1) ... [2020-09-21 12:31:09,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09" (1/1) ... [2020-09-21 12:31:09,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 12:31:09,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 12:31:09,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 12:31:09,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 12:31:09,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 12:31:09,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 12:31:09,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 12:31:09,664 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-21 12:31:09,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 12:31:09,664 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-21 12:31:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 12:31:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 12:31:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-21 12:31:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 12:31:09,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 12:31:09,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 12:31:10,909 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 12:31:10,910 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-21 12:31:10,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:31:10 BoogieIcfgContainer [2020-09-21 12:31:10,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 12:31:10,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 12:31:10,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 12:31:10,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 12:31:10,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 12:31:08" (1/3) ... [2020-09-21 12:31:10,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152050db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:31:10, skipping insertion in model container [2020-09-21 12:31:10,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:09" (2/3) ... [2020-09-21 12:31:10,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152050db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:31:10, skipping insertion in model container [2020-09-21 12:31:10,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:31:10" (3/3) ... [2020-09-21 12:31:10,937 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label15.c [2020-09-21 12:31:10,951 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 12:31:10,967 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 12:31:10,993 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 12:31:11,041 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 12:31:11,042 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 12:31:11,042 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 12:31:11,042 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 12:31:11,043 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 12:31:11,043 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 12:31:11,043 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 12:31:11,043 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 12:31:11,079 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-09-21 12:31:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-21 12:31:11,090 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:11,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:11,092 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:11,101 INFO L82 PathProgramCache]: Analyzing trace with hash -553937361, now seen corresponding path program 1 times [2020-09-21 12:31:11,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:11,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [463871248] [2020-09-21 12:31:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:11,299 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:11,557 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:11,558 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 25 [2020-09-21 12:31:11,558 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:11,558 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 291 [2020-09-21 12:31:11,560 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:11,561 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-21 12:31:11,561 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 6 [2020-09-21 12:31:11,561 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 18 [2020-09-21 12:31:11,561 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-21 12:31:11,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:11,656 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:11,662 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:11,663 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:11,663 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:11,663 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-21 12:31:11,663 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:11,664 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:11,664 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:11,664 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 2 [2020-09-21 12:31:11,664 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:31:11,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [463871248] [2020-09-21 12:31:11,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 12:31:11,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-21 12:31:11,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921891506] [2020-09-21 12:31:11,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-21 12:31:11,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:11,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-21 12:31:11,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-21 12:31:11,711 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 4 states. [2020-09-21 12:31:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:13,276 INFO L93 Difference]: Finished difference Result 581 states and 1007 transitions. [2020-09-21 12:31:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:31:13,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-09-21 12:31:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:13,315 INFO L225 Difference]: With dead ends: 581 [2020-09-21 12:31:13,316 INFO L226 Difference]: Without dead ends: 302 [2020-09-21 12:31:13,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:31:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-09-21 12:31:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2020-09-21 12:31:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-09-21 12:31:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 423 transitions. [2020-09-21 12:31:13,406 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 423 transitions. Word has length 16 [2020-09-21 12:31:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:13,406 INFO L479 AbstractCegarLoop]: Abstraction has 296 states and 423 transitions. [2020-09-21 12:31:13,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-21 12:31:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 423 transitions. [2020-09-21 12:31:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-09-21 12:31:13,411 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:13,411 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:13,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 12:31:13,412 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:13,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2012045842, now seen corresponding path program 1 times [2020-09-21 12:31:13,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:13,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215601342] [2020-09-21 12:31:13,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:13,505 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:13,768 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:13,905 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:14,496 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:14,497 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 99 [2020-09-21 12:31:14,497 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-21 12:31:14,497 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1018 [2020-09-21 12:31:14,499 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:14,499 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:14,499 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 83 [2020-09-21 12:31:14,500 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-09-21 12:31:14,500 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-21 12:31:14,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:14,571 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:14,576 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:14,576 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:14,577 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:14,577 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:31:14,577 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:14,577 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:14,578 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:14,578 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:14,578 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:14,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:14,624 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:14,684 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:14,684 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-09-21 12:31:14,685 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:14,685 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 73 [2020-09-21 12:31:14,685 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:14,685 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:14,686 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:14,686 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-09-21 12:31:14,686 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:31:14,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215601342] [2020-09-21 12:31:14,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:14,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:31:14,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968230737] [2020-09-21 12:31:14,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:31:14,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:14,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:31:14,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:31:14,729 INFO L87 Difference]: Start difference. First operand 296 states and 423 transitions. Second operand 5 states. [2020-09-21 12:31:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:16,043 INFO L93 Difference]: Finished difference Result 886 states and 1296 transitions. [2020-09-21 12:31:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:31:16,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2020-09-21 12:31:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:16,049 INFO L225 Difference]: With dead ends: 886 [2020-09-21 12:31:16,049 INFO L226 Difference]: Without dead ends: 596 [2020-09-21 12:31:16,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 12:31:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-09-21 12:31:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 588. [2020-09-21 12:31:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-09-21 12:31:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 779 transitions. [2020-09-21 12:31:16,093 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 779 transitions. Word has length 88 [2020-09-21 12:31:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:16,094 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 779 transitions. [2020-09-21 12:31:16,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:31:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 779 transitions. [2020-09-21 12:31:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 12:31:16,098 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:16,098 INFO L422 BasicCegarLoop]: trace histogram [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-21 12:31:16,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 12:31:16,099 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:16,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:16,099 INFO L82 PathProgramCache]: Analyzing trace with hash -676040151, now seen corresponding path program 1 times [2020-09-21 12:31:16,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:16,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [406922925] [2020-09-21 12:31:16,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:16,164 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:16,554 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:17,148 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:17,149 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 108 [2020-09-21 12:31:17,149 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:17,149 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1011 [2020-09-21 12:31:17,149 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:17,150 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:17,150 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 92 [2020-09-21 12:31:17,150 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-09-21 12:31:17,150 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:17,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:17,222 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:17,227 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:17,227 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:17,227 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:17,227 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:31:17,227 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:17,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:17,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:17,228 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:17,228 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:17,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:17,274 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:17,328 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:17,329 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 83 [2020-09-21 12:31:17,329 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:17,329 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 70 [2020-09-21 12:31:17,329 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:17,330 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:17,330 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:17,330 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-09-21 12:31:17,330 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 12:31:17,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [406922925] [2020-09-21 12:31:17,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:17,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 12:31:17,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791019237] [2020-09-21 12:31:17,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 12:31:17,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:17,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 12:31:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 12:31:17,382 INFO L87 Difference]: Start difference. First operand 588 states and 779 transitions. Second operand 6 states. [2020-09-21 12:31:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:19,165 INFO L93 Difference]: Finished difference Result 1754 states and 2466 transitions. [2020-09-21 12:31:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 12:31:19,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2020-09-21 12:31:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:19,173 INFO L225 Difference]: With dead ends: 1754 [2020-09-21 12:31:19,173 INFO L226 Difference]: Without dead ends: 1172 [2020-09-21 12:31:19,175 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-09-21 12:31:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-09-21 12:31:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1168. [2020-09-21 12:31:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2020-09-21 12:31:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1536 transitions. [2020-09-21 12:31:19,226 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1536 transitions. Word has length 97 [2020-09-21 12:31:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:19,226 INFO L479 AbstractCegarLoop]: Abstraction has 1168 states and 1536 transitions. [2020-09-21 12:31:19,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 12:31:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1536 transitions. [2020-09-21 12:31:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-21 12:31:19,235 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:19,236 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:19,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 12:31:19,236 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:19,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:19,236 INFO L82 PathProgramCache]: Analyzing trace with hash -219130632, now seen corresponding path program 1 times [2020-09-21 12:31:19,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:19,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [578129693] [2020-09-21 12:31:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:19,341 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:19,524 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:20,310 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:20,310 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 206 [2020-09-21 12:31:20,313 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:20,314 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1012 [2020-09-21 12:31:20,314 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:20,314 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:20,314 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 98 [2020-09-21 12:31:20,315 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-09-21 12:31:20,315 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:20,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:20,390 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:20,395 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:20,395 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:20,395 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:20,395 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:31:20,399 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:20,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:20,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:20,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:20,400 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:20,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:20,454 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:20,557 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:20,558 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 89 [2020-09-21 12:31:20,558 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:20,558 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 124 [2020-09-21 12:31:20,558 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:20,558 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:20,559 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:20,559 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 82 [2020-09-21 12:31:20,559 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:20,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-21 12:31:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:20,648 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:20,760 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:20,760 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 92 [2020-09-21 12:31:20,760 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:20,761 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 129 [2020-09-21 12:31:20,761 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:20,761 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:20,762 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:31:20,762 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-09-21 12:31:20,762 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 12:31:20,915 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [578129693] [2020-09-21 12:31:20,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:20,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:31:20,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432020210] [2020-09-21 12:31:20,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:31:20,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:20,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:31:20,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:31:20,920 INFO L87 Difference]: Start difference. First operand 1168 states and 1536 transitions. Second operand 7 states. [2020-09-21 12:31:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:22,786 INFO L93 Difference]: Finished difference Result 3367 states and 4574 transitions. [2020-09-21 12:31:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 12:31:22,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2020-09-21 12:31:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:22,804 INFO L225 Difference]: With dead ends: 3367 [2020-09-21 12:31:22,804 INFO L226 Difference]: Without dead ends: 2205 [2020-09-21 12:31:22,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-09-21 12:31:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2020-09-21 12:31:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2054. [2020-09-21 12:31:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2020-09-21 12:31:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2624 transitions. [2020-09-21 12:31:22,903 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2624 transitions. Word has length 193 [2020-09-21 12:31:22,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:22,906 INFO L479 AbstractCegarLoop]: Abstraction has 2054 states and 2624 transitions. [2020-09-21 12:31:22,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:31:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2624 transitions. [2020-09-21 12:31:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-09-21 12:31:22,916 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:22,916 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:22,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 12:31:22,917 INFO L427 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1502778873, now seen corresponding path program 1 times [2020-09-21 12:31:22,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:22,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1652141315] [2020-09-21 12:31:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:23,034 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:23,155 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:23,262 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:23,999 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:23,999 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 215 [2020-09-21 12:31:23,999 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-21 12:31:24,000 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1000 [2020-09-21 12:31:24,000 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:24,000 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:24,000 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 107 [2020-09-21 12:31:24,000 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-09-21 12:31:24,001 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:24,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:24,075 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:24,079 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:24,079 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:24,079 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:24,079 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 12:31:24,079 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:24,080 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:24,080 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:24,080 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:24,080 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:24,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:24,131 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:24,197 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:24,198 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 98 [2020-09-21 12:31:24,198 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:24,198 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 84 [2020-09-21 12:31:24,198 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:24,199 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:24,199 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:24,199 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-09-21 12:31:24,199 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:24,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2020-09-21 12:31:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:24,268 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:24,390 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:24,390 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 92 [2020-09-21 12:31:24,390 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:24,391 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 139 [2020-09-21 12:31:24,391 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:24,391 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:24,391 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:31:24,392 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 91 [2020-09-21 12:31:24,392 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 105 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 12:31:24,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1652141315] [2020-09-21 12:31:24,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:24,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:31:24,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186489782] [2020-09-21 12:31:24,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:31:24,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:24,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:31:24,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:31:24,527 INFO L87 Difference]: Start difference. First operand 2054 states and 2624 transitions. Second operand 7 states. [2020-09-21 12:31:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:26,083 INFO L93 Difference]: Finished difference Result 5117 states and 6652 transitions. [2020-09-21 12:31:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 12:31:26,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2020-09-21 12:31:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:26,099 INFO L225 Difference]: With dead ends: 5117 [2020-09-21 12:31:26,099 INFO L226 Difference]: Without dead ends: 3069 [2020-09-21 12:31:26,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-21 12:31:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2020-09-21 12:31:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2924. [2020-09-21 12:31:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2020-09-21 12:31:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 3785 transitions. [2020-09-21 12:31:26,184 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 3785 transitions. Word has length 202 [2020-09-21 12:31:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:26,185 INFO L479 AbstractCegarLoop]: Abstraction has 2924 states and 3785 transitions. [2020-09-21 12:31:26,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:31:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3785 transitions. [2020-09-21 12:31:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-09-21 12:31:26,190 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:26,190 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:26,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 12:31:26,191 INFO L427 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:26,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:26,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2135877389, now seen corresponding path program 1 times [2020-09-21 12:31:26,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:26,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [287616059] [2020-09-21 12:31:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:26,307 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:26,660 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:27,150 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:27,151 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 233 [2020-09-21 12:31:27,151 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:27,151 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 879 [2020-09-21 12:31:27,151 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:27,152 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:27,152 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 90 [2020-09-21 12:31:27,152 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 26 [2020-09-21 12:31:27,152 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:27,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:27,235 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:27,239 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:27,240 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:27,240 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:27,240 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 12:31:27,240 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:27,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:27,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:27,241 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:27,241 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:27,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:27,283 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:27,332 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:27,332 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 81 [2020-09-21 12:31:27,332 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:27,332 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 63 [2020-09-21 12:31:27,333 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:27,333 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:27,333 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:27,333 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 12:31:27,333 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:27,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-09-21 12:31:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:27,409 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:27,488 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:27,653 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:27,654 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-21 12:31:27,654 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:27,654 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 268 [2020-09-21 12:31:27,655 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:27,655 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:27,655 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:31:27,656 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-09-21 12:31:27,656 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-21 12:31:27,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [287616059] [2020-09-21 12:31:27,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:27,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:31:27,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573775430] [2020-09-21 12:31:27,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:31:27,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:27,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:31:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:31:27,875 INFO L87 Difference]: Start difference. First operand 2924 states and 3785 transitions. Second operand 7 states. [2020-09-21 12:31:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:29,210 INFO L93 Difference]: Finished difference Result 5977 states and 8176 transitions. [2020-09-21 12:31:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 12:31:29,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2020-09-21 12:31:29,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:29,230 INFO L225 Difference]: With dead ends: 5977 [2020-09-21 12:31:29,231 INFO L226 Difference]: Without dead ends: 3032 [2020-09-21 12:31:29,239 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-09-21 12:31:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2020-09-21 12:31:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2946. [2020-09-21 12:31:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2020-09-21 12:31:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3833 transitions. [2020-09-21 12:31:29,344 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3833 transitions. Word has length 220 [2020-09-21 12:31:29,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:29,345 INFO L479 AbstractCegarLoop]: Abstraction has 2946 states and 3833 transitions. [2020-09-21 12:31:29,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:31:29,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3833 transitions. [2020-09-21 12:31:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2020-09-21 12:31:29,354 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:29,354 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:29,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 12:31:29,355 INFO L427 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:29,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash 782653915, now seen corresponding path program 1 times [2020-09-21 12:31:29,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:29,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003775041] [2020-09-21 12:31:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:29,501 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:30,183 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:30,184 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 285 [2020-09-21 12:31:30,184 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:30,184 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 745 [2020-09-21 12:31:30,185 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:30,185 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:30,185 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 269 [2020-09-21 12:31:30,186 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 15 [2020-09-21 12:31:30,186 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:30,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:30,283 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:30,293 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:30,293 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:30,293 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:30,294 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 11 [2020-09-21 12:31:30,294 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:30,294 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:30,295 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:30,295 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:30,295 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:30,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:30,320 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:30,354 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:30,354 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 117 [2020-09-21 12:31:30,354 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:30,354 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 39 [2020-09-21 12:31:30,354 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:30,355 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:30,355 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:30,355 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:30,355 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:30,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-21 12:31:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:30,449 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:30,540 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:30,540 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 143 [2020-09-21 12:31:30,541 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:30,541 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 118 [2020-09-21 12:31:30,541 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:30,541 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:30,542 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:30,542 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 136 [2020-09-21 12:31:30,542 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-09-21 12:31:30,653 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003775041] [2020-09-21 12:31:30,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:30,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-21 12:31:30,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813867810] [2020-09-21 12:31:30,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 12:31:30,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:30,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 12:31:30,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-21 12:31:30,657 INFO L87 Difference]: Start difference. First operand 2946 states and 3833 transitions. Second operand 5 states. [2020-09-21 12:31:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:31,916 INFO L93 Difference]: Finished difference Result 3532 states and 4689 transitions. [2020-09-21 12:31:31,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 12:31:31,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 272 [2020-09-21 12:31:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:31,936 INFO L225 Difference]: With dead ends: 3532 [2020-09-21 12:31:31,936 INFO L226 Difference]: Without dead ends: 3530 [2020-09-21 12:31:31,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-21 12:31:31,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2020-09-21 12:31:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 2954. [2020-09-21 12:31:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2954 states. [2020-09-21 12:31:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 3848 transitions. [2020-09-21 12:31:32,016 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 3848 transitions. Word has length 272 [2020-09-21 12:31:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:32,016 INFO L479 AbstractCegarLoop]: Abstraction has 2954 states and 3848 transitions. [2020-09-21 12:31:32,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 12:31:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 3848 transitions. [2020-09-21 12:31:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2020-09-21 12:31:32,026 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:32,026 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:32,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 12:31:32,027 INFO L427 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 726371651, now seen corresponding path program 1 times [2020-09-21 12:31:32,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:32,028 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [399279841] [2020-09-21 12:31:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:32,155 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:32,289 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:33,131 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:33,131 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 324 [2020-09-21 12:31:33,131 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:33,131 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1036 [2020-09-21 12:31:33,131 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:33,131 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:33,132 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 181 [2020-09-21 12:31:33,132 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 20 [2020-09-21 12:31:33,132 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:33,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:33,253 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:33,256 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:33,257 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:33,257 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:33,257 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 4 [2020-09-21 12:31:33,257 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:33,258 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:33,258 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:33,258 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:33,258 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:33,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:33,282 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:33,305 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:33,305 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 72 [2020-09-21 12:31:33,306 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:33,306 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 26 [2020-09-21 12:31:33,306 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:33,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:33,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:33,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:33,308 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:33,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-21 12:31:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:33,395 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:33,484 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:33,484 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 100 [2020-09-21 12:31:33,484 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:33,485 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 113 [2020-09-21 12:31:33,485 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:33,485 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:33,485 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:33,485 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 93 [2020-09-21 12:31:33,486 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:33,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2020-09-21 12:31:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:33,621 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:33,738 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:34,043 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:34,043 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-21 12:31:34,044 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:34,044 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 452 [2020-09-21 12:31:34,044 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:34,045 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:34,045 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:31:34,045 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-09-21 12:31:34,046 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 194 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-09-21 12:31:34,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [399279841] [2020-09-21 12:31:34,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:34,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:31:34,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717100541] [2020-09-21 12:31:34,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:31:34,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:34,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:31:34,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:31:34,338 INFO L87 Difference]: Start difference. First operand 2954 states and 3848 transitions. Second operand 7 states. [2020-09-21 12:31:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:35,702 INFO L93 Difference]: Finished difference Result 6007 states and 8228 transitions. [2020-09-21 12:31:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 12:31:35,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 309 [2020-09-21 12:31:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:35,718 INFO L225 Difference]: With dead ends: 6007 [2020-09-21 12:31:35,718 INFO L226 Difference]: Without dead ends: 3042 [2020-09-21 12:31:35,727 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-09-21 12:31:35,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2020-09-21 12:31:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2970. [2020-09-21 12:31:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2970 states. [2020-09-21 12:31:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 3877 transitions. [2020-09-21 12:31:35,810 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 3877 transitions. Word has length 309 [2020-09-21 12:31:35,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:35,811 INFO L479 AbstractCegarLoop]: Abstraction has 2970 states and 3877 transitions. [2020-09-21 12:31:35,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:31:35,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 3877 transitions. [2020-09-21 12:31:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2020-09-21 12:31:35,824 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:35,824 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:35,824 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 12:31:35,825 INFO L427 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:35,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:35,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1051985820, now seen corresponding path program 1 times [2020-09-21 12:31:35,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:35,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721929866] [2020-09-21 12:31:35,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:35,990 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:36,197 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:36,941 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:36,941 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 343 [2020-09-21 12:31:36,942 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:36,942 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1025 [2020-09-21 12:31:36,942 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:36,942 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:36,943 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 200 [2020-09-21 12:31:36,943 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 128 [2020-09-21 12:31:36,943 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:37,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:37,049 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:37,053 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:37,053 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:37,054 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:37,054 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 6 [2020-09-21 12:31:37,054 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:37,054 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:37,054 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:37,055 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:37,055 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:37,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:37,080 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:37,108 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:37,108 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 117 [2020-09-21 12:31:37,108 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:37,108 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 33 [2020-09-21 12:31:37,109 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:37,109 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:37,109 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:37,109 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:37,109 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:37,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2020-09-21 12:31:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:37,174 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:37,206 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:37,207 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 74 [2020-09-21 12:31:37,207 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:37,207 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 42 [2020-09-21 12:31:37,207 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:37,207 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:37,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:37,208 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 67 [2020-09-21 12:31:37,208 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:37,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2020-09-21 12:31:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:37,276 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:37,451 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:37,451 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-21 12:31:37,451 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:37,451 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 197 [2020-09-21 12:31:37,452 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:37,452 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:37,452 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:31:37,452 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-09-21 12:31:37,452 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 213 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-09-21 12:31:37,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721929866] [2020-09-21 12:31:37,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:37,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:31:37,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855170926] [2020-09-21 12:31:37,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:31:37,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:37,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:31:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:31:37,662 INFO L87 Difference]: Start difference. First operand 2970 states and 3877 transitions. Second operand 7 states. [2020-09-21 12:31:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:39,702 INFO L93 Difference]: Finished difference Result 7204 states and 10216 transitions. [2020-09-21 12:31:39,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 12:31:39,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 328 [2020-09-21 12:31:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:39,726 INFO L225 Difference]: With dead ends: 7204 [2020-09-21 12:31:39,726 INFO L226 Difference]: Without dead ends: 4240 [2020-09-21 12:31:39,737 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-09-21 12:31:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2020-09-21 12:31:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 4124. [2020-09-21 12:31:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4124 states. [2020-09-21 12:31:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 5321 transitions. [2020-09-21 12:31:39,847 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 5321 transitions. Word has length 328 [2020-09-21 12:31:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:39,848 INFO L479 AbstractCegarLoop]: Abstraction has 4124 states and 5321 transitions. [2020-09-21 12:31:39,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:31:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 5321 transitions. [2020-09-21 12:31:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2020-09-21 12:31:39,873 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:39,873 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:39,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 12:31:39,874 INFO L427 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:39,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1829689562, now seen corresponding path program 1 times [2020-09-21 12:31:39,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:39,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1343592840] [2020-09-21 12:31:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:40,013 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:40,167 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:40,963 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:40,964 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 345 [2020-09-21 12:31:40,964 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:40,964 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1011 [2020-09-21 12:31:40,964 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:40,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:40,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 202 [2020-09-21 12:31:40,965 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 17 [2020-09-21 12:31:40,965 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:41,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:41,153 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:41,165 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:41,165 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:41,165 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:41,166 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 12 [2020-09-21 12:31:41,166 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:41,167 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:41,167 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:41,167 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:41,167 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:41,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:41,193 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:41,212 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:41,213 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 72 [2020-09-21 12:31:41,213 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:41,214 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 22 [2020-09-21 12:31:41,214 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:41,214 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:41,215 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:41,215 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:41,215 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:41,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-21 12:31:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:41,299 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:41,398 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:41,398 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 121 [2020-09-21 12:31:41,398 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:41,399 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 125 [2020-09-21 12:31:41,399 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:41,399 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:41,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:41,400 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 114 [2020-09-21 12:31:41,400 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:41,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-09-21 12:31:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:41,541 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:41,693 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:41,820 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:41,820 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-21 12:31:41,820 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-21 12:31:41,821 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 309 [2020-09-21 12:31:41,821 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:41,821 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:41,821 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:31:41,821 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 126 [2020-09-21 12:31:41,822 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-09-21 12:31:42,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1343592840] [2020-09-21 12:31:42,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:42,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:31:42,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571957890] [2020-09-21 12:31:42,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:31:42,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:42,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:31:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:31:42,098 INFO L87 Difference]: Start difference. First operand 4124 states and 5321 transitions. Second operand 7 states. [2020-09-21 12:31:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:43,442 INFO L93 Difference]: Finished difference Result 8320 states and 11020 transitions. [2020-09-21 12:31:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 12:31:43,443 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 330 [2020-09-21 12:31:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:43,472 INFO L225 Difference]: With dead ends: 8320 [2020-09-21 12:31:43,472 INFO L226 Difference]: Without dead ends: 4188 [2020-09-21 12:31:43,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-09-21 12:31:43,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2020-09-21 12:31:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 4132. [2020-09-21 12:31:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4132 states. [2020-09-21 12:31:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 5329 transitions. [2020-09-21 12:31:43,574 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 5329 transitions. Word has length 330 [2020-09-21 12:31:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:43,574 INFO L479 AbstractCegarLoop]: Abstraction has 4132 states and 5329 transitions. [2020-09-21 12:31:43,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:31:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 5329 transitions. [2020-09-21 12:31:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2020-09-21 12:31:43,591 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:43,592 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:43,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 12:31:43,592 INFO L427 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1182845881, now seen corresponding path program 1 times [2020-09-21 12:31:43,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:43,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [715607619] [2020-09-21 12:31:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:43,668 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:43,827 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:43,954 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:44,655 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:44,655 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 346 [2020-09-21 12:31:44,655 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 3 [2020-09-21 12:31:44,655 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 1019 [2020-09-21 12:31:44,656 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:44,656 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:44,656 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 128 [2020-09-21 12:31:44,656 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-09-21 12:31:44,656 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:44,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 12:31:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:44,720 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:44,724 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:44,724 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 9 [2020-09-21 12:31:44,724 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:44,724 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5 [2020-09-21 12:31:44,724 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:44,725 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:44,725 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:44,725 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:44,725 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-21 12:31:44,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-21 12:31:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:44,787 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:44,882 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:44,883 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 119 [2020-09-21 12:31:44,883 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:44,883 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 116 [2020-09-21 12:31:44,884 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:44,884 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-21 12:31:44,884 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-21 12:31:44,885 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 112 [2020-09-21 12:31:44,885 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:44,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2020-09-21 12:31:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:44,973 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:45,119 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:45,119 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-21 12:31:45,120 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:45,120 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 161 [2020-09-21 12:31:45,121 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:45,121 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-21 12:31:45,121 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-21 12:31:45,122 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-21 12:31:45,122 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:45,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2020-09-21 12:31:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 12:31:45,248 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-21 12:31:45,305 FATAL L256 erpolLogProxyWrapper]: Timeout: 1000 [2020-09-21 12:31:45,305 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 127 [2020-09-21 12:31:45,305 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-21 12:31:45,306 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 84 [2020-09-21 12:31:45,306 FATAL L256 erpolLogProxyWrapper]: Heuristic: SMALLEST [2020-09-21 12:31:45,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-21 12:31:45,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 124 [2020-09-21 12:31:45,307 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-21 12:31:45,308 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-21 12:31:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 101 proven. 72 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2020-09-21 12:31:45,525 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [715607619] [2020-09-21 12:31:45,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 12:31:45,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 12:31:45,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850539114] [2020-09-21 12:31:45,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 12:31:45,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 12:31:45,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 12:31:45,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 12:31:45,528 INFO L87 Difference]: Start difference. First operand 4132 states and 5329 transitions. Second operand 7 states. [2020-09-21 12:31:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 12:31:47,399 INFO L93 Difference]: Finished difference Result 8834 states and 12751 transitions. [2020-09-21 12:31:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 12:31:47,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 331 [2020-09-21 12:31:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 12:31:47,418 INFO L225 Difference]: With dead ends: 8834 [2020-09-21 12:31:47,418 INFO L226 Difference]: Without dead ends: 3490 [2020-09-21 12:31:47,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-09-21 12:31:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2020-09-21 12:31:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 3111. [2020-09-21 12:31:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3111 states. [2020-09-21 12:31:47,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 3759 transitions. [2020-09-21 12:31:47,546 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 3759 transitions. Word has length 331 [2020-09-21 12:31:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 12:31:47,547 INFO L479 AbstractCegarLoop]: Abstraction has 3111 states and 3759 transitions. [2020-09-21 12:31:47,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 12:31:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 3759 transitions. [2020-09-21 12:31:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2020-09-21 12:31:47,562 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 12:31:47,562 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 12:31:47,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 12:31:47,563 INFO L427 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 12:31:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 12:31:47,564 INFO L82 PathProgramCache]: Analyzing trace with hash -95771531, now seen corresponding path program 1 times [2020-09-21 12:31:47,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 12:31:47,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931181350] [2020-09-21 12:31:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 12:31:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 12:31:47,661 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 12:31:47,662 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 12:31:47,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 12:31:47,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 12:31:47 BoogieIcfgContainer [2020-09-21 12:31:47,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 12:31:47,751 INFO L168 Benchmark]: Toolchain (without parser) took 39103.15 ms. Allocated memory was 139.5 MB in the beginning and 759.7 MB in the end (delta: 620.2 MB). Free memory was 101.3 MB in the beginning and 401.7 MB in the end (delta: -300.3 MB). Peak memory consumption was 319.9 MB. Max. memory is 7.1 GB. [2020-09-21 12:31:47,755 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-21 12:31:47,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.93 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.7 MB in the beginning and 170.5 MB in the end (delta: -69.8 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. [2020-09-21 12:31:47,758 INFO L168 Benchmark]: Boogie Preprocessor took 151.86 ms. Allocated memory is still 204.5 MB. Free memory was 170.5 MB in the beginning and 165.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-09-21 12:31:47,759 INFO L168 Benchmark]: RCFGBuilder took 1351.92 ms. Allocated memory was 204.5 MB in the beginning and 237.5 MB in the end (delta: 33.0 MB). Free memory was 165.5 MB in the beginning and 181.1 MB in the end (delta: -15.6 MB). Peak memory consumption was 82.7 MB. Max. memory is 7.1 GB. [2020-09-21 12:31:47,764 INFO L168 Benchmark]: TraceAbstraction took 36824.86 ms. Allocated memory was 237.5 MB in the beginning and 759.7 MB in the end (delta: 522.2 MB). Free memory was 181.1 MB in the beginning and 401.7 MB in the end (delta: -220.5 MB). Peak memory consumption was 301.7 MB. Max. memory is 7.1 GB. [2020-09-21 12:31:47,770 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.93 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 100.7 MB in the beginning and 170.5 MB in the end (delta: -69.8 MB). Peak memory consumption was 33.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.86 ms. Allocated memory is still 204.5 MB. Free memory was 170.5 MB in the beginning and 165.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1351.92 ms. Allocated memory was 204.5 MB in the beginning and 237.5 MB in the end (delta: 33.0 MB). Free memory was 165.5 MB in the beginning and 181.1 MB in the end (delta: -15.6 MB). Peak memory consumption was 82.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36824.86 ms. Allocated memory was 237.5 MB in the beginning and 759.7 MB in the end (delta: 522.2 MB). Free memory was 181.1 MB in the beginning and 401.7 MB in the end (delta: -220.5 MB). Peak memory consumption was 301.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 34]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L426] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L427] a10 = 1 [L429] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L287] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L288] a19 = 10 [L290] return 25; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) [L454] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) [L460] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) [L465] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) [L471] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) [L476] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) [L481] COND TRUE (((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10)) [L482] a1 = ((((a1 * 10)/ -9) * 5) - 333686) [L483] a10 = 4 [L484] a19 = 6 [L486] 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 TRUE (((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L34] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.6s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 323 SDtfs, 4178 SDslu, 375 SDs, 0 SdLazy, 9653 SolverSat, 1379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4132occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 1599 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 2727 NumberOfCodeBlocks, 2727 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2375 ConstructedInterpolants, 0 QuantifiedInterpolants, 1429500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 1500/1588 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...